Reproduce “On the maximum length of cyclic MDS codes” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Gaojun Luo, Xiwang Cao, Shitao Li, Yang Li
The authors prove length bounds for nontrivial simple-root cyclic MDS codes over finite fields. Cyclic symmetry constrains Fourier support, which is balanced modulo divisors of the code length. Their theorems show that the length is at most q+1 when its prime factors lie in {2,3,5,7}, and in additional specified arithmetic cases. These results do not cover every cyclic MDS code.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.