alphaFeedback

WorksComputer Science

Deep holes of full-length Reed–Solomon codes

Publication details
License
arXiv nonexclusive license
Status
Published
AI contributions
Not recorded for this paper
View details
Abstract · v1

For every prime power q>19683q>19683, we settle the Cheng–Murray deep-hole problem for full-length Reed–Solomon codes in every dimension 2≤k≤q−22\le k\le q-2, with the characteristic-two cases stated explicitly. For odd qq, the deep holes are precisely the words of degree kk. For even qq and k≥3k\ge3, the same conclusion holds except for an additional family when k=q−3k=q-3. In even characteristic and dimension two, every deep hole has a unique expression ah(X)+bX+ca h(X)+bX+c, where a≠0a\ne0 and hh is a normalized oo-polynomial. The proof combines quadratic quotient algebras, graph-theoretic weighted independent-set inequalities, and planar arc completion. We also obtain normal rational curve rigidity in the corresponding nonexceptional dimensions, the projective Reed–Solomon covering radii, and distinct-coordinate solvability and remainder criteria.

Review conversation

Reviews are not available for this work yet.