This volume presents the proceedings of the first French-Soviet workshop on algebraic coding, held in Paris in July 1991. The idea for the workshop, born in Leningrad (now St. Petersburg) in 1990, was to bring together some of the best Soviet coding theorists. Scientists from France, Finland, Germany, Israel, Italy, Spain, and the United States also attended. The papers in the volume fall rather naturally into four categories: - Applications of exponential sums - Covering radius - Constructions -Decoding.
Author(s): A. Tietäväinen (auth.), Gérard Cohen, Antoine Lobstein, Gilles Zémor, Simon Litsyn (eds.)
Series: Lecture Notes in Computer Science 573
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1992
Language: English
Pages: 161
Tags: Coding and Information Theory; Algebraic Geometry; Combinatorics; Communications Engineering, Networks
On the correlation of sequences....Pages 1-4
On Gaussian sums for finite fields and elliptic curves....Pages 5-15
Exponential sums and constrained error-correcting codes....Pages 16-22
Constructions of codes with covering radius 2....Pages 23-31
On perfect weighted coverings with small radius....Pages 32-41
An extremal problem related to the covering radius of binary codes....Pages 42-51
Bounds on covering radius of dual product codes....Pages 52-57
Remarks on greedy codes....Pages 58-66
On nonbinary codes with fixed distance....Pages 67-74
Saddle point techniques in asymptotic coding theory....Pages 75-81
Non-binary low rate convolutional codes with almost optimum weight spectrum....Pages 82-86
Position recovery on a circle based on coding theory....Pages 87-101
The lower bound for cardinality of codes correcting errors and defects....Pages 102-112
Soft decoding for block codes obtained from convolutional codes....Pages 113-119
Partial ordering of error patterns for maximum likelihood soft decoding....Pages 120-125
A fast matrix decoding algorithm for rank-error-correcting codes....Pages 126-133
A fast search for the maximum element of the fourier spectrum....Pages 134-141
Coding theorem for discrete memoryless channels with given decision rule....Pages 142-150
Decoding for multiple-access channels....Pages 151-158
