A survey of constructive coding theory, and a table of binary codes of highest known rate
From MaRDI portal
Publication:2555036
DOI10.1016/0012-365X(72)90036-2zbMath0244.94004OpenAlexW2060939374MaRDI QIDQ2555036
Publication date: 1972
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(72)90036-2
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Enumerative combinatorics (05A99) Theory of error-correcting codes and error-detecting codes (94B99) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to linear algebra (15-00)
Related Items
Algebraic theory of block codes detecting independent errors, A new upper bound for binary codes with minimum distance four
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- On the Golay perfect binary code
- A characterisation of Leech's lattice
- Symmetry codes over GF(3) and new five-designs
- Euler products, cyclotomy, and coding
- Good self dual codes exist
- Nearly perfect binary codes
- On the existence of a projective plane of order 10
- A classification of self-orthogonal codes over GF(2)
- On a new class of binary group codes
- A search technique for quasi-perfect codes
- A class of low-rate nonlinear binary codes
- Further results on error correcting binary group codes
- Semisimple cyclic and Abelian codes. II
- Error Detecting and Error Correcting Codes
- Some Sphere Packings in Higher Space
- Optimum(n,2)codes for small values of channel error probability (Corresp.)
- Power moment identities on weight distributions in error correcting codes
- Long BCH codes are bad
- An optimum nonlinear code
- A New Class of Cyclic Codes
- Notes on Sphere Packings
- Factorization of cyclic codes
- A survey of progress in coding theory in the Soviet Union
- Some lower bounds on the minimum weight of cyclic codes of composite length
- New binary coding results by circulants
- A class of optimum nonlinear double-error-correcting codes
- An upper bound on<tex>k/n</tex>for affine-invariant codes with fixed<tex>d/n</tex>(Corresp.)
- On the uniqueness of the Golay codes
- Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes
- Tree encoding of memoryless time-discrete sources with a fidelity criterion
- New 5-designs
- Adding Two Information Symbols to Certain Nonbinary BCH Codes and Some Applications
- On the Minimum Distance of Bose-Chaudhuri-Hocquenghem Codes
- Burst-trapping techniques for a compound channel
- Some results on quasi-cyclic codes
- A Group of Order 8,315,553,613,086,720,000
- On a new family of symmetry codes and related new five-designs
- Nonbinary random error-correcting codes (Corresp.)
- Maximal Group Codes with Specified Minimum Distance
- Analysis of a Burst-Trapping Error Correction Procedure
- New sphere packings in dimensions 9-15
- Some Mathematical Properties of a Scheme for Reducing the Bandwidth of Motion Pictures by Hadamard Smearing
- On the symmetry of good nonlinear codes
- Binary Codes Which Are Ideals in the Group Algebra of an Abelian Group
- On the weight structure of Reed-Muller codes
- Weight enumerator for second-order Reed-Muller codes
- A new look at the Golay (23, 12) code (Corresp.)
- Decoding of circulant codes (Corresp.)
- New family of single-error correcting codes
- Sphere Packings and Error-Correcting Codes
- The weight enumerators for certain subcodes of the second order binary Reed-Muller codes
- Polynomial codes
- On the theory of group codes
- Coding theory and the Mathieu groups
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- Reachable sets for linear dynamical systems
- A note on the decoding of double-error-correcting binary BCH codes of primitive length (Corresp.)
- The complexity of decoders--II: Computational work and decoding time
- A bound for cyclic codes of composite length (Corresp.)
- Weight distributions of the cosets of the (32,6) Reed-Muller code
- A note on the minimum distance structure of cyclic codes (Corresp.)
- Srivastava codes
- On upper bounds for unrestricted binary-error-correcting codes
- A NEW FAMILY OF NONLINEAR CODES OBTAINED FROM CONFERENCE MATRICES
- Long primitive binary BCH codes have distance<tex>d leq 2n ln R^{-1}/log n cdots</tex>
- Gleason's theorem on self-dual codes
- Weights of irreducible cyclic codes
- Decoding beyond the BCH bound (Corresp.)
- Generalizations of the BCH bound
- Some results on the minimum distance structure of cyclic codes
- Survey of Soviet research in information theory
- New binary codes
- A new description of the Nadler code (Corresp.)
- Generalizations of Gleason's theorem on weight enumerators of self-dual codes
- Circulant bases for cyclic codes (Corresp.)
- Maximum distance<tex>q</tex>-nary codes
- The Mathieu Groups
- A survey of perfect codes
