On the List and Bounded Distance Decodibility of the Reed-Solomon Codes
classification
🧮 math.NT
cs.ITmath.IT
keywords
listreed-solomonboundedbounded-distanceboundscertaincodecodes
read the original abstract
In this paper show that the list and bounded-distance decoding problems of certain bounds for the Reed-Solomon code are at least as hard as the discrete logarithm problem over finite fields.
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.