论文信息 - Bounds of the bit error probability of a linear cyclic code over GF(2l) and its extended code

Bounds of the bit error probability of a linear cyclic code over GF(2l) and its extended code

An upper bound on the bit-error probability (BEP) of a linear cyclic code over GF(2/sup l/) with hard-decision (HD) maximum-likelihood (ML) decoding on memoryless symmetric channels is derived. Performance results are presented for Reed-Solomon codes on GF(32), GF(64), and GF

Unjeng Cheng | Gaylord K. Huth

[1] Z. M. Huntoon,et al. On the computation of the probability of post-decoding error events for block codes (Corresp.) , 1977, IEEE Trans. Inf. Theory.

[2] Andrew J. Viterbi,et al. Convolutional Codes and Their Performance in Communication Systems , 1971 .