New constructions of binary cyclic codes [2^m-1, 2^{m-1}±1, d] with d ≥ 2^{m/2}-1 and d^perp ≥ 2^{m/2} (m even), plus similar families for m odd and m product of two primes, achieving d·d^perp asymptotically 2n.
On cyclic codes of composite leng th and the minimum distance II,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
New Constructions of Binary Cyclic Codes with Both Relatively Large Minimum Distance and Dual Distance
New constructions of binary cyclic codes [2^m-1, 2^{m-1}±1, d] with d ≥ 2^{m/2}-1 and d^perp ≥ 2^{m/2} (m even), plus similar families for m odd and m product of two primes, achieving d·d^perp asymptotically 2n.