Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
Submitted to the IEEE Trans. on Information Theory (as a correspondence), February 2006

Keywords

Information Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/133839

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0607003
 http://arxiv.org/abs/cs/0607003

Collections

arXiv