Algebraic Coding : First French-Soviet Workshop Paris, July 22–24, 1991 Proceedings, edited by Gérard Cohen, Antoine Lobstein, Gilles Zémor, Simon Litsyn, (electronic resource)

Resource Information

The instance Algebraic Coding : First French-Soviet Workshop Paris, July 22–24, 1991 Proceedings, edited by Gérard Cohen, Antoine Lobstein, Gilles Zémor, Simon Litsyn, (electronic resource) represents a material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries. This resource is a combination of several types including: Instance, Electronic.

Image

http://covers.openlibrary.org/b/isbn/9783540467397-M.jpg?default=false

Label

Algebraic Coding : First French-Soviet Workshop Paris, July 22–24, 1991 Proceedings, edited by Gérard Cohen, Antoine Lobstein, Gilles Zémor, Simon Litsyn, (electronic resource)

Title remainder

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

Medium

electronic resource

Statement of responsibility

edited by Gérard Cohen, Antoine Lobstein, Gilles Zémor, Simon Litsyn

Instantiates

• Algebraic Coding : First French-Soviet Workshop Paris, July 22–24, 1991 Proceedings

Publication

• Berlin, Heidelberg, Springer Berlin Heidelberg, 1992

Antecedent source

mixed

Carrier category

online resource

Carrier category code

cr

Carrier MARC source

rdacarrier

Color

not applicable

Content category

text

Content type code

txt

Content type MARC source

rdacontent

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

Dimensions

unknown

Extent

XI, 161 p.

File format

multiple file formats

Form of item

electronic

Isbn

9783540467397

Level of compression

uncompressed

Media category

computer

Media MARC source

rdamedia

Media type code

c

Other control number

10.1007/BFb0034333

Other physical details

online resource.

Quality assurance targets

absent

Record ID

992079143901161

Reformatting quality

access

Specific material designation

remote

System control number

(DE-He213)978-3-540-46739-7