Reproduce “Covering Arrays From Line-Polychromatic Colourings of Affine Planes” 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
Bai XunDi
The authors construct covering arrays that add a column to Reed–Solomon arrays by mapping each pattern on old columns to a line in an affine plane and coloring its points. When every line contains c colors, the construction gives a bound of q^t+(q−c)q^(t−1) rows. For t=4 and q=19, it uses 195,301 rows, below a listed upper bound of 253,422, not a proven minimum.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.