The length of primitive BCH codes with minimal covering radius

DOI10.1023/A:1008299101833MaRDI QIDQ676684zbMATH OpenFDO

Authors Stephen D. Cohen

Publication date 17 August 1997

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1008299101833

zbMATH Keywords

covering radiusprimitive binary BCH code

Mathematics Subject Classification ID

Cyclic codes (94B15) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• The covering radii of a class of binary cyclic codes and some BCH codes
• An asymptotic bound on the covering radii of binary BCH codes
• On the covering radius of some binary cyclic codes
• On the covering radius of long 5-ary BCH codes with minimum distance 7

Cited in

(10)

• Polynomial factorisation and an application to regular directed graphs
• Long binary narrow-sense BCH codes are normal
• The covering radii of a class of binary cyclic codes and some BCH codes
• The two covering radius of the two error correcting BCH code
• An asymptotic bound on the covering radii of binary BCH codes
• scientific article; zbMATH DE number 729918 (Why is no real title available?)
• Finite Fields and Applications
• scientific article; zbMATH DE number 2124960 (Why is no real title available?)
• scientific article; zbMATH DE number 975392 (Why is no real title available?)
• The second generalized covering radius of binary primitive double-error-correcting BCH codes

This page was built for publication: The length of primitive BCH codes with minimal covering radius

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