Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=229

• On the arithmetics of Galois fields and the like
  Thomas Beth
  Lecture Notes in Computer Science 229, 1986, pp. 2-16
• On strongly tactical codes
  Michael Gundlach
  Lecture Notes in Computer Science 229, 1986, pp. 17-26
• Integer programming applied to eigenvector computation in a class of Markov processes
  Andre Oisel
  Lecture Notes in Computer Science 229, 1986, pp. 27-33
• A minimum system of generators for extended cyclic codes which are invariant under the affine group
  P. Charpin
  Lecture Notes in Computer Science 229, 1986, pp. 34-42
• Some algebraic tools for error-correcting codes
  A. Poli
  Lecture Notes in Computer Science 229, 1986, pp. 43-60
• On computing the performance probabilities of Reed-Solomon codes
  Sylvia Jennings
  Lecture Notes in Computer Science 229, 1986, pp. 61-68
• Numerical experiments related to the covering radius of some first order Reed-Muller codes
  J. Constantin, B. Courteau, J. Wolfmann
  Lecture Notes in Computer Science 229, 1986, pp. 69-75
• Several aspects of problems encountered in coding applications
  C. Goutelard
  Lecture Notes in Computer Science 229, 1986, pp. 76-94
• Software simulation of data transmission using error-correcting codes, through an AWGN channel
  M.C. Gennero, D. Randriananja
  Lecture Notes in Computer Science 229, 1986, pp. 95-107
• Algebraic methods for constructing asymmetric cryptosystems
  Hideki Imai, Tsutomu Matsumoto
  Lecture Notes in Computer Science 229, 1986, pp. 108-119
• Covering radii of even subcodes of t-dense codes
  H. Janwa, H.F., Jr. Mattson
  Lecture Notes in Computer Science 229, 1986, pp. 120-130
• Orthogonal transform encoding of cyclic codes
  W. Fumy
  Lecture Notes in Computer Science 229, 1986, pp. 131-134
• On s-sum-sets and projective codes
  Mercè Griera, Josep Rifà, Llorenç Huguet
  Lecture Notes in Computer Science 229, 1986, pp. 135-142
• Pseudo-triple-sum-sets and association schemes
  Llorenç Huguet, Josep Rifà, Mercè Griera
  Lecture Notes in Computer Science 229, 1986, pp. 143-149
• A decoding algorithm for linear codes
  Martin Bossert, Ferdinand Hergert
  Lecture Notes in Computer Science 229, 1986, pp. 150-155
• The finite Fourier-transform and theta functions
  Hans Opolka
  Lecture Notes in Computer Science 229, 1986, pp. 156-166
• Recent results on coding and algebraic geometry
  J. Wolfmann
  Lecture Notes in Computer Science 229, 1986, pp. 167-184
• Some properties of elliptic codes over a field of characteristic 2
  Yves Driencourt
  Lecture Notes in Computer Science 229, 1986, pp. 185-193
• Self-dual codes 2n circulant over F_q (q=2^r)
  A. Poli, C. Rigoni
  Lecture Notes in Computer Science 229, 1986, pp. 194-201
• Automorphisms and isometries of some modular algebras
  M. Ventou
  Lecture Notes in Computer Science 229, 1986, pp. 202-210
• A lower bound for the bilinear complexity of some semisimple Lie algebras
  Hans F. de Groote, Joos Heintz
  Lecture Notes in Computer Science 229, 1986, pp. 211-222
• On computational complexity of some algebraic curves over finite fields
  D. Le Brigand
  Lecture Notes in Computer Science 229, 1986, pp. 223-227
• Some group presentations and enforcing the associative law
  M.F. Newman
  Lecture Notes in Computer Science 229, 1986, pp. 228-237
• Fast computation of linear finite-dimensional operators over arbitrary rings
  Edward G. Belaga
  Lecture Notes in Computer Science 229, 1986, pp. 238-246
• Quantifier elimination for real closed fields
  W. Böge
  Lecture Notes in Computer Science 229, 1986, pp. 247-261