Information-bit, information-symbol, and decoded-symbol error rates for linear block codes

Abstract

There are two types of bounded-distance decoders for linear block codes: erasing decoders that discard uncorrectable received words, and reproducing decoders that reproduce uncorrectable received words. Exact expressions for the information-symbol and decoded-symbol error rates are derived for both types. Necessary and sufficient conditions are derived for the quality of the information-symbol and decoded symbol error rates, It is formally proved that these two error rates are equal for cyclic codes with either erasing or reproducing decoders. For reproducing decoders, two approximations to the information-bit error rate and their applicability are examined.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>