New Binary Self-Dual Cyclic Codes with Square-Root-Like Minimum Distances
(2306.11423)Abstract
The construction of self-dual codes over small fields such that their minimum distances are as large as possible is a long-standing challenging problem in the coding theory. In 2009, a family of binary self-dual cyclic codes with lengths $ni$ and minimum distances $di \geq \frac{1}{2} \sqrt{ni}$, $ni$ goes to the infinity for $i=1,2, \ldots$, was constructed. In this paper, we construct a family of (repeated-root) binary self-dual cyclic codes with lengths $n$ and minimum distances at least $\sqrt{n}-2$. New families of lengths $n=qm-1$, $m=3, 5, \ldots$, self-dual codes over ${\bf F}_q$, $q \equiv 1$ $mod$ $4$, with their minimum distances larger than or equal to $\sqrt{\frac{q}{2}}\sqrt{n}-q$ are also constructed.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.