On a (145, 32) binary cyclic code

DOI10.1109/18.796404MaRDI QIDQ4503465zbMATH OpenOpenAlexFDO

Authors

Publication date 7 September 2000

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

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

zbMATH Keywords

binary cyclic codeminimum distance

Mathematics Subject Classification ID

Cyclic codes (94B15)

Recommendations

• On binary cyclic codes with minimum distance d=3.
• Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\)
• On the minimum distances of non-binary cyclic codes
• New binary codes from a chain of cyclic codes
• scientific article; zbMATH DE number 1426187

Cited in

(6)

• On binary cyclic codes with minimum distance d=3.
• Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\)
• On the minimum distances of non-binary cyclic codes
• scientific article; zbMATH DE number 3700718 (Why is no real title available?)
• scientific article; zbMATH DE number 493082 (Why is no real title available?)
• Reduced linear codes from cyclic ones

This page was built for publication: On a (145, 32) binary cyclic code

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