A new proof of the BCH bound (Corresp.)

DOI10.1109/TIT.1972.1054838zbMATH Open0241.94012OpenAlexW1970246163MaRDI QIDQ5652535FDOQ5652535

Authors: Robert Tienwen Chien 

Publication date: 1972

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

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

Recommendations

• scientific article; zbMATH DE number 3873229
• A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
• scientific article; zbMATH DE number 1932292
• Cyclic and BCH codes whose minimum distance equals their maximum BCH bound
• Upper bounds on the dual distance of BCH\((255, k)\)

Mathematics Subject Classification ID

Cyclic codes (94B15) Bounds on codes (94B65)

Cited In (1)

• Preparata codes through lattices

This page was built for publication: A new proof of the BCH bound (Corresp.)

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