Deep-hole classification conjecture for projective Reed–Solomon codes

About 10 years old · traced to

Let qq be odd and 2≤k≤q−22\le k\le q-2. Represent a word of Fqq+1\mathbb{F}_q^{q+1} as (uf,v)(u_f,v), where uf=(f(α1),…,f(αq))u_f=(f(\alpha_1),\ldots,f(\alpha_q)) is defined by a polynomial ff of degree at most q−1q-1 and v∈Fqv\in\mathbb{F}_q.

Projective deep-hole conjecture. The set

{(uf,v)∣deg⁡(f)=k, v∈Fq}\{(u_f,v)\mid \deg(f)=k,\ v\in\mathbb{F}_q\}

is precisely the set of all deep holes of PRS(q+1,k)PRS(q+1,k).

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 deg⁡(f)≥k+1\deg(f)\ge k+1.

References

Primary source

Jun Zhang and Daqing Wan, “On Deep Holes of Projective Reed-Solomon Codes”, arXiv:1605.02423 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.