A survey of constructive coding theory, and a table of binary codes of highest known rate
From MaRDI portal
(Redirected from Publication:2555036)
Enumerative combinatorics (05A99) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to linear algebra (15-00) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Theory of error-correcting codes and error-detecting codes (94B99)
Cites work
- A bound for cyclic codes of composite length (Corresp.)
- A characterisation of Leech's lattice
- A class of low-rate nonlinear binary codes
- A class of optimum nonlinear double-error-correcting codes
- A classification of self-orthogonal codes over GF(2)
- A Group of Order 8,315,553,613,086,720,000
- A Mathematical Theory of Communication
- A New Class of Cyclic Codes
- A new description of the Nadler code (Corresp.)
- A NEW FAMILY OF NONLINEAR CODES OBTAINED FROM CONFERENCE MATRICES
- A new look at the Golay (23, 12) code (Corresp.)
- A note on the decoding of double-error-correcting binary BCH codes of primitive length (Corresp.)
- A note on the minimum distance structure of cyclic codes (Corresp.)
- A search technique for quasi-perfect codes
- A survey of perfect codes
- A survey of progress in coding theory in the Soviet Union
- Adding Two Information Symbols to Certain Nonbinary BCH Codes and Some Applications
- An optimum nonlinear code
- An upper bound on<tex>k/n</tex>for affine-invariant codes with fixed<tex>d/n</tex>(Corresp.)
- Analysis of a Burst-Trapping Error Correction Procedure
- Binary Codes Which Are Ideals in the Group Algebra of an Abelian Group
- Burst-trapping techniques for a compound channel
- Circulant bases for cyclic codes (Corresp.)
- Coding theory and the Mathieu groups
- Decoding beyond the BCH bound (Corresp.)
- Decoding of circulant codes (Corresp.)
- Error detecting and error correcting codes
- Euler products, cyclotomy, and coding
- Factorization of cyclic codes
- Further results on error correcting binary group codes
- Generalizations of Gleason's theorem on weight enumerators of self-dual codes
- Generalizations of the BCH bound
- Gleason's theorem on self-dual codes
- Good self dual codes exist
- scientific article; zbMATH DE number 3147923 (Why is no real title available?)
- scientific article; zbMATH DE number 3763833 (Why is no real title available?)
- scientific article; zbMATH DE number 3458467 (Why is no real title available?)
- scientific article; zbMATH DE number 3458474 (Why is no real title available?)
- scientific article; zbMATH DE number 3463504 (Why is no real title available?)
- scientific article; zbMATH DE number 3480474 (Why is no real title available?)
- scientific article; zbMATH DE number 3480483 (Why is no real title available?)
- scientific article; zbMATH DE number 3547190 (Why is no real title available?)
- scientific article; zbMATH DE number 3245047 (Why is no real title available?)
- scientific article; zbMATH DE number 3307993 (Why is no real title available?)
- scientific article; zbMATH DE number 3318360 (Why is no real title available?)
- scientific article; zbMATH DE number 3318548 (Why is no real title available?)
- scientific article; zbMATH DE number 3331442 (Why is no real title available?)
- scientific article; zbMATH DE number 3335652 (Why is no real title available?)
- scientific article; zbMATH DE number 3336526 (Why is no real title available?)
- scientific article; zbMATH DE number 3394010 (Why is no real title available?)
- scientific article; zbMATH DE number 3394018 (Why is no real title available?)
- scientific article; zbMATH DE number 3400774 (Why is no real title available?)
- scientific article; zbMATH DE number 3405807 (Why is no real title available?)
- scientific article; zbMATH DE number 3410914 (Why is no real title available?)
- scientific article; zbMATH DE number 3409222 (Why is no real title available?)
- Long BCH codes are bad
- Long primitive binary BCH codes have distance<tex>d leq 2n ln R^{-1}/log n cdots</tex>
- Maximal Group Codes with Specified Minimum Distance
- Maximum distance<tex>q</tex>-nary codes
- Nearly perfect binary codes
- New 5-designs
- New binary codes
- New binary coding results by circulants
- New family of single-error correcting codes
- New sphere packings in dimensions 9-15
- Nonbinary random error-correcting codes (Corresp.)
- Notes on Sphere Packings
- On a new class of binary group codes
- On a new family of symmetry codes and related new five-designs
- On the existence of a projective plane of order 10
- On the Golay perfect binary code
- On the Minimum Distance of Bose-Chaudhuri-Hocquenghem Codes
- On the symmetry of good nonlinear codes
- On the theory of group codes
- On the uniqueness of the Golay codes
- On the weight structure of Reed-Muller codes
- On upper bounds for unrestricted binary-error-correcting codes
- Optimum(n,2)codes for small values of channel error probability (Corresp.)
- Polynomial codes
- Power moment identities on weight distributions in error correcting codes
- Reachable sets for linear dynamical systems
- Semisimple cyclic and Abelian codes. II
- Some lower bounds on the minimum weight of cyclic codes of composite length
- Some Mathematical Properties of a Scheme for Reducing the Bandwidth of Motion Pictures by Hadamard Smearing
- Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes
- Some results on quasi-cyclic codes
- Some results on the minimum distance structure of cyclic codes
- Some Sphere Packings in Higher Space
- Sphere Packings and Error-Correcting Codes
- Srivastava codes
- Survey of Soviet research in information theory
- Symmetry codes over GF(3) and new five-designs
- The complexity of decoders--II: Computational work and decoding time
- The Mathieu Groups
- The weight enumerators for certain subcodes of the second order binary Reed-Muller codes
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- Tree encoding of memoryless time-discrete sources with a fidelity criterion
- Weight distributions of the cosets of the (32,6) Reed-Muller code
- Weight enumerator for second-order Reed-Muller codes
- Weights of irreducible cyclic codes
Cited in
(2)
This page was built for publication: A survey of constructive coding theory, and a table of binary codes of highest known rate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2555036)
