Computer Science – Information Theory
Scientific paper
2004-07-04
IEEE Transactions on Information Theory vol. 51, no. 12, pp. 4237-4246 (2005).
Computer Science
Information Theory
16 pages, 3 figures. Submitted to IEEE Transactions on Information Theory. The revision was done for a final journal version (
Scientific paper
We address the problem of bounding below the probability of error under maximum likelihood decoding of a binary code with a known distance distribution used on a binary symmetric channel. An improved upper bound is given for the maximum attainable exponent of this probability (the reliability function of the channel). In particular, we prove that the ``random coding exponent'' is the true value of the channel reliability for code rate $R$ in some interval immediately below the critical rate of the channel. An analogous result is obtained for the Gaussian channel.
Barg Alexander
McGregor Andrew
No associations
LandOfFree
Distance distribution of binary codes and the error probability of decoding 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 Distance distribution of binary codes and the error probability of decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distance distribution of binary codes and the error probability of decoding will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-72685