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

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

2006-07-02

arxiv.org/abs/cs/0607003v1

Computer Science

Information Theory

Submitted to the IEEE Trans. on Information Theory (as a correspondence), February 2006

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-451180