Efficient erasure decoding of Reed-Solomon codes

Simple item page
dc.creatorDidier, Frederic
dc.date2009-01-14
dc.date.accessioned2026-07-07T12:29:27Z
dc.date.available2026-07-07T12:29:27Z
dc.descriptionWe 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.
dc.description4 pages, submitted to ISIT 2009
dc.identifierhttps://arxiv.org/abs/0901.1886
dc.identifierhttp://arxiv.org/abs/0901.1886
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/215881
dc.subjectInformation Theory
dc.subjectData Structures and Algorithms
dc.titleEfficient erasure decoding of Reed-Solomon codes
dc.typetext

Files

Collections

arXiv