The conjecture that no cyclic codes have both constant relative distance and dual distance
The conjecture that no cyclic codes have both constant relative distance and dual distance
Let be a fixed prime power. An infinite family of cyclic codes over has constant relative distance if its relative distance is bounded below by a positive constant, and has constant relative dual distance if the relative distance of the dual family is bounded below by a positive constant. Cyclic-code distance conjecture. There does not exist an infinite family of cyclic codes over with both constant relative distance and constant relative dual distance. This is presented as an intermediate step toward the conjecture that asymptotically good cyclic codes do not exist; the paper gives no resolution.
Sources & referencesView supporting material
Primary source
Oren Dubin, Noam Oz and Noga Ron-Zewi, “Efficient Decoding of Double-circulant and Wozencraft Codes from Square-root Errors”, arXiv:2507.13548 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.