Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
<|reference_start|>Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes: 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.<|reference_end|>
@article{twitto2006tightened,
    title={Tightened Upper Bounds on the ML Decoding Error Probability of Binary
  Linear Block Codes},
    author={M. Twitto, I. Sason and S. Shamai},
    journal={arXiv preprint arXiv:cs/0607003},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0607003},
    primaryClass={cs.IT math.IT}
}