Extends Chen-Ding construction to even ord_n(q), proves square-root min-distance bounds for self-dual cyclic codes, determines exact parameters for select cases, and refines parameters for improved distances.
The minimum distance of three classes of primitive BCH codes and certain classes of cyclic codes,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Self-Dual Cyclic Codes with Improved Minimum Distance Estimates via Extending the Chen-Ding Construction
Extends Chen-Ding construction to even ord_n(q), proves square-root min-distance bounds for self-dual cyclic codes, determines exact parameters for select cases, and refines parameters for improved distances.