Optimal threshold-based multi-trial error/erasure decoding with the Guruswami-Sudan algorithm
Christian Senger, Vladimir R. Sidorenko, Martin Bossert, Victor Zyablov · 2011
Traditionally, multi-trial error/erasure decoding of Reed-Solomon (RS) codes is based on Bounded Minimum Distance (BMD) decoders with an erasure option. Such decoders have error/erasure tradeoff factor λ = 2, which means that an error is twice as expensive as an erasure in terms of the code's minimum distance. The Guruswami-Sudan (GS) list decoder can be considered as state of the art in algebraic decoding of RS codes. Besides an erasure option, it allows to adjust λ to values in the range 1BMDdecoding trials can result in lower residual codeword error probability than GS decoders with zGStrials, if zBMDis only slightly larger than zGS. This is of practical interest since BMD decoders generally have lower computational complexity than GS decoders.