Efficient erasure decoding of Reed-Solomon codes

Details Efficient erasure decoding of Reed-Solomon codes Efficient erasure decoding of Reed-Solomon codes

2009-01-14

arxiv.org/abs/0901.1886v1

Computer Science

Information Theory

4 pages, submitted to ISIT 2009

Scientific paper

We present a practical algorithm to decode erasures of Reed-Solomon codes over the q elements binary field in O(q \log_2^2 q) time where the constant implied by the O-notation is very small. Asymptotically fast algorithms based on fast polynomial arithmetic were already known, but even if their complexity is similar, they are mostly impractical. By comparison our algorithm uses only a few Walsh transforms and has been easily implemented.

Affiliated with

Also associated with

No associations

Rating

Efficient erasure decoding of 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 Efficient erasure decoding of Reed-Solomon codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient erasure decoding of Reed-Solomon codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-374526