RNC completeness conjecture for MDS extensions

Let qq be a prime power and let mm be an integer for which the stated MDS codes are defined. An [q+1,m]q[q+1,m]_q Reed–Solomon code corresponds to a normal rational curve (RNC) in PG(m1,q)PG(m-1,q), and an MDS extension by one coordinate is an [q+2,m]q[q+2,m]_q MDS code extending it. RNC completeness conjecture. There is no [q+2,m]q[q+2,m]_q MDS code extending an [q+1,m]q[q+1,m]_q Reed–Solomon code, except when qq is even and m=3m=3 or m=q1m=q-1; equivalently, the RNC in PG(m1,q)PG(m-1,q) is a complete arc except in those cases. The source notes that this conjecture is implied by the MDS conjecture and proves that the preceding MDS-extension conjecture implies it.

Sources & referencesView supporting material

Primary source

Krishna Kaipa, “Deep holes and MDS extensions of Reed-Solomon codes”, arXiv:1612.05447 (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.