Deep-hole classification conjectures for full-length Reed–Solomon codes
For every prime power and integer , let . For each received word , let be its unique interpolation polynomial of degree at most . Determine exactly all received words satisfying , equivalently all deep holes of the full-length Reed–Solomon code, for arbitrary and .
References
Source: arXiv
Progress summary
A new paper reports substantial partial classifications and exclusion results, but the complete classification remains open.
The problem seeks a complete description of deep holes in full-length standard Reed–Solomon codes for all parameters. Existing conjectures and results cover important ranges, but not the full arbitrary-parameter problem.
Known results
- Cheng–Murray, 2007: proposed the standard deep-hole classification conjecture.
- A 2012 result disproved that conjecture in general by constructing deep holes whose interpolation polynomial has a degree- monomial component.
- A 2016 study proved the conjecture for , apart from an even-field exception, while leaving open.
- A 2013 result classified deep holes for prime-field generalized codes in the range , not for all parameters.
October 22, 2026 partial classification
Xiang Fan's paper reports complete classifications for five excess degrees and uniform no-deep-hole bounds for arbitrary under field-size conditions, with finite cases supported by certificates and deterministic programs. These are substantial advances, but the report does not claim the remaining arbitrary- cases are resolved; the result is treated here as unverified.
Current status (as of October 2026): Several parameter ranges and bounds are claimed, while the complete classification for arbitrary remains open.
Solutions 0
No solutions have been posted yet.