Cantitate/Preț
Produs
Total produse
Vezi coșul
Algebraic Coding de Gerard Cohen

Algebraic Coding

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

Preț: 31561 lei

Preț vechi: 39451 lei
-20%

Puncte Express: 473

Carte tipărită la comandă

Livrare economică 28 iulie-11 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783540551300
ISBN-10: 3540551301
Pagini: 172
Ilustrații: XI, 161 p.
Dimensiuni: 155 x 235 x 10 mm
Greutate: 0.27 kg
Ediția:1992
Editura: Springer
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.