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 generat...Show MoreMetadata
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 Berlekamppsilas 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.
Published in: 2008 IEEE Information Theory Workshop
Date of Conference: 05-09 May 2008
Date Added to IEEE Xplore: 25 July 2008
ISBN Information: