Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
Information Theory
2007-07-13 v1 math.IT
Abstract
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 AWGN channel. An expurgation of the distance spectrum of binary linear block codes further tightens the resulting upper bounds.
Cite
@article{arxiv.cs/0607003,
title = {Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes},
author = {M. Twitto and I. Sason and S. Shamai},
journal= {arXiv preprint arXiv:cs/0607003},
year = {2007}
}
Comments
Submitted to the IEEE Trans. on Information Theory (as a correspondence), February 2006