The conjecture that asymptotically good cyclic codes do not exist

Let qq be a fixed prime power. A family of cyclic codes over \Fq\F_q is asymptotically good if it has positive limiting rate and positive limiting relative distance. Cyclic-code asymptotic-goodness conjecture. There does not exist an infinite family of asymptotically good cyclic codes over \Fq\F_q. The paper recalls this as a conjecture underlying limitations for cyclic-code-based double-circulant and Wozencraft codes, and does not resolve it.

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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.