Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
Finding all small error-prone substructures in LDPC codes
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid for any memoryless, binary-input and output-symmetric communication channel, and their effectiveness is exemplified for various ensembles of turbo-like codes over the additive white Gaussian noise (AWGN) channel. An expurgation of the distance spectrum of binary linear block codes further tightens the resulting upper bounds