RNC completeness conjecture for MDS extensions
RNC completeness conjecture for MDS extensions
Let be a prime power and let be an integer for which the stated MDS codes are defined. An Reed–Solomon code corresponds to a normal rational curve (RNC) in , and an MDS extension by one coordinate is an MDS code extending it. RNC completeness conjecture. There is no MDS code extending an Reed–Solomon code, except when is even and or ; equivalently, the RNC in 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
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.