Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2227

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

The ubiquity of Reed-Muller codes
James L. Massey
Lecture Notes in Computer Science 2227, 2001, pp. 1-12
Self-dual codes-theme and variations
Vera Pless
Lecture Notes in Computer Science 2227, 2001, pp. 13-21
Design of differential space-time codes using group theory
Amin Shokrollahi
Lecture Notes in Computer Science 2227, 2001, pp. 22-35
Ideal error-correcting codes: Unifying algebraic and number-theoretic algorithms
Madhu Sudan
Lecture Notes in Computer Science 2227, 2001, pp. 36-45
Self-dual codes using image restoration techniques
A. Baliga, J. Chua
Lecture Notes in Computer Science 2227, 2001, pp. 46-56
Low complexity tail-biting trellises of self-dual codes of length 24, 32 and 40 over GF(2) and Z_4 of large minimum distance
E. Cadic, J.C. Carlach, G. Olocco, A. Otmani, J.P. Tillich
Lecture Notes in Computer Science 2227, 2001, pp. 57-66
F_q-linear cyclic codes over F_{q^m}: DFT characterization
Bikash Kumar Dey, B. Sundar Rajan
Lecture Notes in Computer Science 2227, 2001, pp. 67-76
Cyclic projective Reed-Muller codes
Thierry P. Berger, Louis de Maximy
Lecture Notes in Computer Science 2227, 2001, pp. 77-81
Codes identifying sets of vertices
Tero Laihonen, Sanna Ranto
Lecture Notes in Computer Science 2227, 2001, pp. 82-91
Duality and greedy weights of linear codes and projective multisets
Hans Georg Schaathun
Lecture Notes in Computer Science 2227, 2001, pp. 92-101
Type II codes over IF_{2^r}
Koichi Betsumiya, Masaaki Harada, Akihiro Munemasa
Lecture Notes in Computer Science 2227, 2001, pp. 102-111
On senary simplex codes
Manish K. Gupta, David G. Glynn, T. Aaron Gulliver
Lecture Notes in Computer Science 2227, 2001, pp. 112-121
Optimal double circulant Z_4-codes
T. Aaron Gulliver, Masaaki Harada
Lecture Notes in Computer Science 2227, 2001, pp. 122-128
Constructions of codes from number fields
Venkatesan Guruswami
Lecture Notes in Computer Science 2227, 2001, pp. 129-140
On generalized Hamming weights for codes over finite chain rings
Hiroshi Horimoto, Keisuke Shiromoto
Lecture Notes in Computer Science 2227, 2001, pp. 141-150
Information rates and weights of codes in structural matrix rings
Andrei Kelarev, Olga Sokratova
Lecture Notes in Computer Science 2227, 2001, pp. 151-158
On hyperbolic codes
Olav Geil, Tom Hholdt
Lecture Notes in Computer Science 2227, 2001, pp. 159-171
On fast interpolation method for Guruswami-Sudan list decoding of one-point algebraic-geometry codes
Shojiro Sakata
Lecture Notes in Computer Science 2227, 2001, pp. 172-181
Computing the genus of a class of curves
M.C. Rodríguez-Palánquex, L.J. García-Villalba, I. Luengo-Velasco
Lecture Notes in Computer Science 2227, 2001, pp. 182-191
Iterations of multivariate polynomials and discrepancy of pseudorandom numbers
Jaime Gutierrez, Domingo Gomez-Perez
Lecture Notes in Computer Science 2227, 2001, pp. 192-199
Even length binary sequence families with low negaperiodic autocorrelation
Matthew G. Parker
Lecture Notes in Computer Science 2227, 2001, pp. 200-209
On the non-existence of (almost-)perfect quaternary sequences
Patrice Parraud
Lecture Notes in Computer Science 2227, 2001, pp. 210-218
Maximal periods of x^2 + c in F_q
A. Peinado, F. Montoya, J. Muñoz, A.J. Yuste
Lecture Notes in Computer Science 2227, 2001, pp. 219-228
On the aperiodic correlation function of Galois ring m-sequences
P. Udaya, S. Boztaş
Lecture Notes in Computer Science 2227, 2001, pp. 229-238
Euclidean modules and multisequence synthesis
Liping Wang
Lecture Notes in Computer Science 2227, 2001, pp. 239-248

Seiten 1 2 >