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

Author

Twitto, M. ; Sason, I. ; Shamai, Shlomo

Author_Institution

Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa

Volume

53

Issue

4

fYear

2007

fDate

4/1/2007 12:00:00 AM

Firstpage

1495

Lastpage

1510

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 additive white Gaussian noise (AWGN) channel. An expurgation of the distance spectrum of binary linear block codes further tightens the resulting upper bounds

Keywords

AWGN channels; binary codes; block codes; channel coding; error statistics; linear codes; maximum likelihood decoding; memoryless systems; turbo codes; AWGN channel; ML decoding error probability; additive white Gaussian noise; binary linear block codes; maximum-likelihood decoding; memoryless channel; turbo-like codes; AWGN; Additive white noise; Block codes; Communication channels; Error probability; Information theory; Linear code; Maximum likelihood decoding; Parity check codes; Upper bound; Block codes; bounds; linear codes; maximum-likelihood (ML) decoding;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2007.892807

Filename

4137901