Built on

The theory of error-correcting codes
Original
F.J. MacWilliams and N.J.A. Sloane · 1977
Earlier work this paper cites.
Data structures and algorithms / Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman
Alfred V. Aho, Jeffrey D. Ullman, and John E. Hopcroft · 1983
Earlier work this paper cites.

Similar

An xor-based erasure-resilient coding scheme
J. Blomer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, and D. Zuckerman · 1995
Cited alongside, same era.

Then

Efficient erasure correcting codes
M.G. Luby, M. Mitzenmacher, M.A. Shokrollahi, and D.A. Spielman · 2001
Later among the works it cites.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

Reading the bibliography…

2009

Efficient erasure decoding of Reed-Solomon codes

Didier, Frederic

Understand

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.