Amazon cover image
Image from Amazon.com

Algebraic coding : first French-Soviet workshop, Paris, July 22-24, 1991 : proceedings / G. Cohen [and others] (eds.).

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 573.Publication details: Berlin ; New York : Springer-Verlag, ©1992.Description: 1 online resource (x, 158 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540467397
  • 3540467394
Subject(s): Genre/Form: Additional physical formats: Print version:: Algebraic coding.DDC classification:
  • 003/.54 20
LOC classification:
  • QA268 .A4 1992
Other classification:
  • 53.71
  • *94-06
  • 00B25
Online resources:
Contents:
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.
Action note:
  • digitized 2021. HathiTrust Digital Library committed to preserve
Summary: 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.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references.

Online resource; title from PDF title page (SpringerLink, viewed August 9, 2013).

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.

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.

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [Place of publication not identified]: HathiTrust Digital Library. 2021. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2021. HathiTrust Digital Library committed to preserve pda MiAaHDL

Powered by Koha