Skip to main content
SpringerLink
Log in

Algebraic Coding

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

  • Conference proceedings
  • © 1992

Overview

Editors:
  1. Gérard Cohen
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Antoine Lobstein
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Gilles Zémor
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Simon Litsyn
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 573)

Included in the following conference series:

Conference proceedings info: Algebraic Coding 1991.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (19 papers)

  1. Front Matter

    Download chapter PDF

  2. On the correlation of sequences

    • A. Tietäväinen
    Pages 1-4

  3. On Gaussian sums for finite fields and elliptic curves

    • Shparlinski I. E.
    Pages 5-15

  4. Exponential sums and constrained error-correcting codes

    • Alexander Barg
    Pages 16-22

  5. Constructions of codes with covering radius 2

    • Alexander A. Davydov
    Pages 23-31

  6. On perfect weighted coverings with small radius

    • Gérard D. Cohen, Simon N. Litsyn, H. F. Mattson Jr.
    Pages 32-41

  7. An extremal problem related to the covering radius of binary codes

    • G. Zémor
    Pages 42-51

  8. Bounds on covering radius of dual product codes

    • G. L. Katsman
    Pages 52-57

  9. Remarks on greedy codes

    • Vera Pless
    Pages 58-66

  10. On nonbinary codes with fixed distance

    • Ilya I. Dumer
    Pages 67-74

  11. Saddle point techniques in asymptotic coding theory

    • Danièle Gardy, Patrick Solé
    Pages 75-81

  12. Non-binary low rate convolutional codes with almost optimum weight spectrum

    • Sergei I. Kovalev
    Pages 82-86

  13. Position recovery on a circle based on coding theory

    • Benjamin Arazi
    Pages 87-101

  14. The lower bound for cardinality of codes correcting errors and defects

    • V. Blinovsky
    Pages 102-112

  15. Soft decoding for block codes obtained from convolutional codes

    • Boris D. Kudryashov
    Pages 113-119

  16. Partial ordering of error patterns for maximum likelihood soft decoding

    • Jakov Snyders
    Pages 120-125

  17. A fast matrix decoding algorithm for rank-error-correcting codes

    • Ernst M. Gabidulin
    Pages 126-133

  18. A fast search for the maximum element of the fourier spectrum

    • Alexey E. Ashikhmin, Simon N. Litsyn
    Pages 134-141

  19. Coding theorem for discrete memoryless channels with given decision rule

    • Vladimir B. Balakirsky
    Pages 142-150

  20. Decoding for multiple-access channels

    • Irina E. Bocharova
    Pages 151-158
Back to top

Other volumes

  1. Algebraic Coding

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation