On Cyclic Codes of Composite Length and the Minimum Distance II

DOI10.1109/TIT.2021.3066008MaRDI QIDQ4958210zbMATH OpenOpenAlexFDO

Authors Maosheng Xiong, Aixian Zhang

Publication date 7 September 2021

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

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

Mathematics Subject Classification ID

Cyclic codes (94B15)

Cited in

(11)

• Some lengths for which CPP interleavers have weaker minimum distances than QPP interleavers
• Four infinite families of ternary cyclic codes with a square-root-like lower bound
• Five infinite families of binary cyclic codes and their related codes with good parameters
• Parameters of several families of binary duadic codes and their related codes
• Several families of binary cyclic codes with good parameters
• 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
• Several infinite families of binary cyclic codes with square-root-like lower bounds
• Binary \([n,(n \pm 1)/2]\) cyclic codes with good minimum distances from sequences

This page was built for publication: On Cyclic Codes of Composite Length and the Minimum Distance II

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