Completeness conjecture for deep holes of twisted Reed–Solomon codes
Completeness conjecture for deep holes of twisted Reed–Solomon codes
Let be a prime power, let specify the twist defining the twisted Reed–Solomon code , and let be the source-defined set of admissible correction polynomials. A deep hole is a word at covering-radius distance from the code. Completeness conjecture for twisted Reed–Solomon codes. For , all deep holes of have generating polynomials
with and . This conjecture proposes that the described family gives all deep holes for the indicated parameter range. The paper presents the problem as a preliminary exploration and notes that the relatively small-dimension case remains an interesting direction for future work; no resolution is supplied.
Sources & referencesView supporting material
Primary source
Weijun Fang, Jingke Xu and Ruiqi Zhu, “Deep Holes of Twisted Reed-Solomon Codes”, arXiv:2403.11436 (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.