Efficient erasure decoding of Reed-Solomon codes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
4 pages, submitted to ISIT 2009

Keywords

Information Theory, Data Structures and Algorithms

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/215881

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0901.1886
 http://arxiv.org/abs/0901.1886

Collections

arXiv