Traditionally, multi-trial error/erasuredecoding of Reed-Solomon (RS) codes is based on Bounded Minimum Distance (BMD) decoders with an erasure option. Such decoders have error/erasure tradeoff factor lambda = 2, whi...
详细信息
ISBN:
(纸本)9781457705953
Traditionally, multi-trial error/erasuredecoding of Reed-Solomon (RS) codes is based on Bounded Minimum Distance (BMD) decoders with an erasure option. Such decoders have error/erasure tradeoff factor lambda = 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 lambda to values in the range 1 < lambda <= 2. based on previous work [1], we provide formulae which allow to optimally (in terms of residual codeword error probability) exploit the erasure option of decoders with arbitrary lambda, if the decoder can be used z >= 1 times. We show that BMD decoders with z(BMD) decoding trials can result in lower residual codeword error probability than GS decoders with z(GS) trials, if z(BMD) is only slightly larger than z(GS). This is of practical interest since BMD decoders generally have lower computational complexity than GS decoders.
暂无评论