Long BCH codes are bad

DOI10.1016/S0019-9958(67)90660-2MaRDI QIDQ5538289zbMATH OpenFDO

Authors Shu Lin, Edward J. Jun. Weldon

Publication date 1967

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(67)90660-2

zbMATH Keywords

information, communication

Cited in

(9)

• Algebraic theory of block codes detecting independent errors
• Good cyclic codes and the uncertainty principle
• Several classes of asymptotically good quasi-twisted codes with a low index
• A survey of constructive coding theory, and a table of binary codes of highest known rate
• Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
• Correcting errors and erasures via the syndrome variety
• BCH cyclic codes
• Asymptotic performance of double circulant and four circulant codes with small hull dimension
• BCH codes and distance multi- or fractional colorings in hypercubes asymptotically

This page was built for publication: Long BCH codes are bad

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