| dc.contributor.author | Versfeld, D.J.J. | |
| dc.contributor.author | Helberg, A.S.J. | |
| dc.contributor.author | Ferreira, H.C. | |
| dc.date.accessioned | 2017-02-07T09:06:39Z | |
| dc.date.available | 2017-02-07T09:06:39Z | |
| dc.date.issued | 2008 | |
| dc.identifier.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] | en_US |
| dc.identifier.isbn | 978-1-4244-2271-5 (Online) | |
| dc.identifier.isbn | 978-1-4244-2269-2 | |
| dc.identifier.uri | http://hdl.handle.net/10394/20171 | |
| dc.identifier.uri | https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4578695 | |
| dc.identifier.uri | https://doi.org/10.1109/ITW.2008.4578695 | |
| dc.description.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 | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | IEEE | en_US |
| dc.subject | Reed-Solomon codes | en_US |
| dc.subject | Algebraic codes | en_US |
| dc.subject | Decoding | en_US |
| dc.title | Efficient packet erasure decoding by transforming the systematic generator matrix of an RS code | en_US |
| dc.type | Presentation | en_US |
| dc.contributor.researchID | 12363626 - Helberg, Albertus Stephanus Jacobus | |
