An infinite family of binary cyclic codes with best parameters

DOI10.1109/TIT.2023.3307732MaRDI QIDQ6576236zbMATH OpenFDO

Authors Zhonghua Sun, Chengju Li, Cunsheng Ding

Publication date 22 July 2024

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

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

zbMATH Keywords

binary cyclic codesbinary Hamming codebinary quadratic residue codesdistance-optimalinfinite family of binary BCH codespunctured binary Reed-Muller codes

Mathematics Subject Classification ID

Cyclic codes (94B15)

Cited in

(10)

• Self-orthogonal cyclic codes with good parameters
• Some cyclic and negacyclic codes with square-root-like bounds on their minimum distances
• Optimal CIS codes, optimal t-CIS codes and their applications in cryptography
• Binary duadic codes and their related codes with a square-root-like lower bound
• An infinite family of binary cyclic codes and two infinite families of ternary cyclic codes with good parameters
• Constructions of binary cyclic codes with minimum weights exceeding the square-root lower bound
• A tighter bound on the minimum distances for an infinite family of binary BCH codes and its generalization
• Three families of binary cyclic codes with good lower bounds
• Binary \([n,(n \pm 1)/2]\) cyclic codes with good minimum distances from sequences
• Some results on Schur powers and cubes of primitive narrow-sense BCH codes

This page was built for publication: An infinite family of binary cyclic codes with best parameters

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