The Cheng-Murray Conjecture on Deep Holes of Full-Length Reed-Solomon Codes

Abstract

Let $R{S}_q(k)$ denote the full-length Reed--Solomon code over ${\mathbb{F}}_q$. Every word $u=(u_x{)}_{x\in {\mathbb{F}}_q}\in {\mathbb{F}}_q^q$ has a unique interpolation polynomial $U(X)\in {\mathbb{F}}_q[X]$ of degree less than $q$, satisfying $U(x)=u_x$ for all $x\in {\mathbb{F}}_q$. It is well known that every word with $°U=k$ is a deep hole. The Cheng--Murray conjecture asserts that these are the only deep holes for $3\le k\le q-2$, except when $q$ is even and $k=q-3$. Previous results established the conjecture for $k\le p-1$ and for $k\ge \lfloor (q-1)/2\rfloor$, where $p$ is the characteristic of ${\mathbb{F}}_q$. In this paper, we prove the Cheng--Murray conjecture in the remaining range $3\le k\le \lfloor q/2\rfloor$, thereby resolving it completely. Our proof combines two complementary approaches. The tangent envelope of a marked arc yields differential constraints that establish the conjecture for $3\le k\le q/2$ when $q$ is even, and for $3\le k\le \lceil q/3\rceil$ when $q$ is odd. For the remaining cases with $q$ odd, we combine local syndrome compatibility with combinatorial arguments to rule out additional deep holes.

arXiv comment33pages