Cyclic and BCH codes whose minimum distance equals their maximum BCH bound

DOI10.3934/AMC.2016018MaRDI QIDQ326325zbMATH OpenOpenAlexFDO

Authors José Joaquín Bernal, Diana H. Bueno-Carreño, Juan Jacobo Simón

Publication date 12 October 2016

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/amc.2016018

zbMATH Keywords

cyclic codesminimum distanceBCH codesapparent distanceBCH bound

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1932292
• BCH codes with minimum distance proportional to code length
• A method to enlarge the design distance of BCH codes and some classes of infinite optimal cyclic codes
• On the minimum distance of cyclic codes
• scientific article; zbMATH DE number 1426187

Cites work

• scientific article; zbMATH DE number 3547190 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1284424 (Why is no real title available?)
• Algebraic generalization of BCH-Goppa-Helgert codes
• Fundamentals of Error-Correcting Codes
• On the minimum distance of cyclic codes

Cited in

(8)

• A new procedure for decoding cyclic and BCH codes up to actual minimum distance
• A method to enlarge the design distance of BCH codes and some classes of infinite optimal cyclic codes
• On a class of wide-sense binary BCH codes whose minimum distances exceed the BCH bound (Corresp.)
• A non-cyclic triple-error-correcting BCH-like code and some minimum distance results
• scientific article; zbMATH DE number 975392 (Why is no real title available?)
• BCH cyclic codes
• Constructions of abelian codes multiplying dimension of cyclic codes
• A new proof of the BCH bound (Corresp.)

Describes a project that uses

Uses Software

• GAP

This page was built for publication: Cyclic and BCH codes whose minimum distance equals their maximum BCH bound

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