Deep holes and MDS extensions of Reed-Solomon codes
classification
💻 cs.IT
math.COmath.IT
keywords
codesdeepholesproblemreed-solomonclassifyingextensionsallows
read the original abstract
We study the problem of classifying deep holes of Reed-Solomon codes. We show that this problem is equivalent to the problem of classifying MDS extensions of Reed-Solomon codes by one digit. This equivalence allows us to improve recent results on the former problem. In particular, we classify deep holes of Reed-Solomon codes of dimension greater than half the alphabet size. We also give a complete classification of deep holes of Reed Solomon codes with redundancy three in all dimensions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.