Answers are grounded in this paper and cite their sources.
Constructing an infinite family of binary cyclic codes with good parameters is an interesting topic. The objective of this paper is to construct several families of binary cyclic codes with a square-root-like lower bound. An infinite family of binary cyclic codes of length 2ᵐ-1 and minimum distance d≥ 2ᵐ⁻¹m+2 is presented. Several infinite families of binary duadic codes with variable length and have a square-root-like lower bound are constructed. As a by-product, several families of binary self-dual codes with a square-root-like lower bound are presented. These families of binary cyclic codes contain optimal linear codes.
No takes yet. Share an insight, caveat, or question.
Sun et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: