Lecture Notes in Computer Science, No. 573, Springer-Verlag, 158 pages, 1992.

Gérard COHEN, Simon LITSYN, Antoine LOBSTEIN, Gilles ZÉMOR (Eds).

Contents.
A. Tietäväinen: On the correlation of sequences, p. 1
I.E. Shparlinski: On Gaussian sums for finite fields and elliptic curves, p. 5
A. Barg: Exponential sums and constrained error-correcting codes, p. 16
A.A. Davydov: Constructions of codes with covering radius 2, p. 23
G.D. Cohen, S.N. Litsyn, H.F. Mattson, Jr.: On perfect weighted coverings with small radius, p. 32
G. Zémor: An extremal problem related to the covering radius of binary codes, p. 42
G.L. Katsman: Bounds on covering radius of dual product codes, p. 52
V. Pless: Remarks on greedy codes, p. 58
I.I. Dumer: On nonbinary codes with fixed distance, p. 67
D. Gardy, P. Solé: Saddle point techniques in asymptotic coding theory, p. 75
S.I. Kovalev: Nonbinary low rate convolutional codes with almost optimum weight spectrum, p. 82
B. Arazi: Position recovery on a circle based on coding theory, p. 87
V. Blinovsky: The lower bound for cardinality of codes correcting errors and defects, p. 102
B.D. Kudryashov: Soft decoding for block codes obtained from convolutional codes, p. 113
J. Snyders: Partial ordering of error patterns for maximum likelihood soft decoding, p. 120
E.M. Gabidulin: A fast matrix decoding algorithm for rank-error-correcting codes, p. 126
A.E. Ashikhmin, S.N. Litsyn: A fast search for the maximum element of the Fourier spectrum, p. 134
V.B. Balakirsky: Coding theorem for discrete memoryless channels with given decision rule, p. 142
I.E. Bocharova: Decoding for multiple-access channels, p. 151

La photo du congrès !

Revenir à la page d'accueil