Algebraic Coding

First French-Soviet Workshop, Paris, July 22-24, 1991. Proceedings

AvGerard Cohen,Simon N. Litsyn

Häftad, Engelska, 1992

Del i serien Lecture Notes in Computer Science

551 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This volume presents the proceedings of the firstFrench-Soviet workshop on algebraic coding, held in Paris inJuly 1991. The idea for the workshop, born in Leningrad (nowSt. Petersburg) in 1990, was to bring together some of thebest Soviet coding theorists. Scientists from France,Finland, Germany, Israel, Italy, Spain, and the UnitedStates also attended. The papers in the volume fall rather naturally into fourcategories:- Applications of exponential sums- Covering radius- Constructions-Decoding.

Produktinformation

Utgivningsdatum:1992-02-12
Mått:155 x 233 x 10 mm
Vikt:271 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:161
Upplaga:1992
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540551300

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

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.