Algebraic Coding

First French-Soviet Workshop, Paris, July 22-24, 1991. Proceedings
1992
ISBN: 978-3-540-55130-0
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 573, 161 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 271 g

Reihe: Lecture Notes in Computer Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Cohen, Gerard

Zemor, Gilles

Litsyn, Simon N.

Lobstein, Antoine

Fachgebiete

• Mathematik | Informatik Mathematik Algebra Elementare Algebra
• Technische Wissenschaften Elektronik | Nachrichtentechnik Nachrichten- und Kommunikationstechnik Fernmeldetechnik
• Mathematik | Informatik EDV | Informatik Daten / Datenbanken Informationstheorie, Kodierungstheorie
• Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik Mathematik Geometrie Algebraische Geometrie

Inhaltsverzeichnis

On the correlation of sequences.- On Gaussian sums for finite fields and elliptic curves.- Exponential sums and constrained error-correcting codes.- Constructions of codes with covering radius 2.- On perfect weighted coverings with small radius.- An extremal problem related to the covering radius of binary codes.- Bounds on covering radius of dual product codes.- Remarks on greedy codes.- On nonbinary codes with fixed distance.- Saddle point techniques in asymptotic coding theory.- Non-binary low rate convolutional codes with almost optimum weight spectrum.- Position recovery on a circle based on coding theory.- The lower bound for cardinality of codes correcting errors and defects.- Soft decoding for block codes obtained from convolutional codes.- Partial ordering of error patterns for maximum likelihood soft decoding.- A fast matrix decoding algorithm for rank-error-correcting codes.- A fast search for the maximum element of the fourier spectrum.- Coding theorem for discrete memoryless channels with given decision rule.- Decoding for multiple-access channels.