NWU Institutional Repository

Efficient packet erasure decoding by transforming the systematic generator matrix of an RS code

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

IEEE

Abstract

We consider the erasures-only decoding of Reed-Solomon codes. One class of erasure decoders of algebraic codes can be viewed as a transformation of the systematic generator matrix, as first noticed by Berlekamp. We extend Berlekamp’s method to Reed-Solomon codes and compare the performance of the decoder with various other Reed-Solomon erasure decoders. The developed decoder reduces the decoding time of packet erasures significantly when used in conjunction with a modified interleaver found in the literature

Description

Citation

Versfeld, D.J.J. et al. 2008. Efficient packet erasure decoding by transforming the systematic generator matrix of an RS code. IEEE Information Theory Workshop. ITW '08, 5-9 May: 401-405. [https://doi.org/10.1109/ITW.2008.4578695]

Endorsement

Review

Supplemented By

Referenced By