Versfeld, D.J.J.Helberg, A.S.J.Ferreira, H.C.2017-02-072017-02-072008Versfeld, 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]978-1-4244-2271-5 (Online)978-1-4244-2269-2http://hdl.handle.net/10394/20171https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4578695https://doi.org/10.1109/ITW.2008.4578695We 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 literatureenReed-Solomon codesAlgebraic codesDecodingEfficient packet erasure decoding by transforming the systematic generator matrix of an RS codePresentation