Cantitate/Preț
Produs

Algebraic Coding: First French-Soviet Workshop, Paris, July 22-24, 1991. Proceedings: Lecture Notes in Computer Science, cartea 573

Editat de Gerard Cohen, Simon N. Litsyn, Antoine Lobstein, Gilles Zemor
en Limba Engleză Paperback – 12 feb 1992
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32646 lei

Preț vechi: 40807 lei
-20% Nou

Puncte Express: 490

Preț estimativ în valută:
6250 6521$ 5239£

Carte tipărită la comandă

Livrare economică 12-26 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540551300
ISBN-10: 3540551301
Pagini: 172
Ilustrații: XI, 161 p.
Dimensiuni: 155 x 233 x 9 mm
Greutate: 0.25 kg
Ediția:1992
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.