On the List and Bounded Distance Decodibility of the Reed-Solomon Codes
Qi Cheng, Daqing Wan
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.
Create a lesson
Related papers
Unit fraction representations using shifted Golomb primes
Rishika Agrawal
Improved deterministic integer factorization by quadratic-image sieving
Pantelimon Stănică
Private key sieves for improved attacks on RSA
Markus Hittmeir
Multiple q-zeta values as polynomials in partition multiplicities
Jan-Willem M. van Ittersum
Hopf-Galois Structures on Extensions Arising from Division Points on Elliptic Curves
Leolin Nkuete
Certified Collision Exclusion and an Unconditional Upper Bound Λ<0.156821 for the de Bruijn--Newman Constant
Michel Planat, Dale James Raymond