Algebraic coding : first French-Soviet workshop, Paris, July 22-24, 1991 : proceedings
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, German...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Další autoři: | , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
573 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Actes d'un séminaire tenu à Paris du 22 au 24 juillet 1991, d'après l écran-titre Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algebraic coding, first French-Soviet workshop, Paris, July 22-24, 1991, proceedings, G. Cohen ... [et al.] (eds.), Berlin, Springer-Verlag, 1992, 1 vol. (X-158 p.), Lecture notes in computer science, 3-540-55130-1 • Algebraic Coding, Texte imprimé, 9783662191002 |
Obsah:
- 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.