Deep-hole classification conjecture for projective Reed–Solomon codes
Deep-hole classification conjecture for projective Reed–Solomon codes
Let be odd and . Represent a word of as , where is defined by a polynomial of degree at most and .
Projective deep-hole conjecture. The set
is precisely the set of all deep holes of .
The conjecture is stronger than the covering-radius conjecture and aims to classify every deep hole of these projective Reed–Solomon codes. The paper proves the assertion under additional hypotheses and gives partial exclusion results for words with .
Sources & referencesView supporting material
Primary source
Jun Zhang and Daqing Wan, “On Deep Holes of Projective Reed-Solomon Codes”, arXiv:1605.02423 (2016).
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.