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. The effectiveness of these bounds is exemplified for ensembles of turbo-like codes
Published in:
Information Theory, 2006 IEEE International Symposium on
Date of Conference: 9-14 July 2006