On the List and Bounded Distance Decodibility of the Reed-Solomon Codes

Details On the List and Bounded Distance Decodibility of the Reed-Solomon Codes On the List and Bounded Distance Decodibility of the Reed-Solomon Codes

2004-05-05

arxiv.org/abs/math/0405082v1

Mathematics

Number Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the List and Bounded Distance Decodibility of the Reed-Solomon Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the List and Bounded Distance Decodibility of the Reed-Solomon Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the List and Bounded Distance Decodibility of the Reed-Solomon Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-467427