Some long cyclic linear binary codes are not so bad

DOI10.1109/TIT.1974.1055222MaRDI QIDQ4068576zbMATH OpenOpenAlexFDO

Authors Elwyn R. Berlekamp, Jørn Justesen

Publication date 1974

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.1974.1055222

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(8)

• Algebraic theory of block codes detecting independent errors
• Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6
• Cyclic and pseudo-cyclic MDS codes of length \(q + 1\)
• The weight enumerator polynomials of some classes of codes with composite parity-check polynomials
• Periodic distribution of generalized B-J codes and constructions of cyclically permutable (CP) codes.
• Some \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\)
• Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
• Coding for a multiple access OR channel: A survey

This page was built for publication: Some long cyclic linear binary codes are not so bad

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4068576)