Computer Science – Information Theory
Scientific paper
2006-10-25
Computer Science
Information Theory
10 pages, 1 figure, updated missing reference
Scientific paper
In a remarkable paper published in 1976, Burnashev determined the reliability function of variable-length block codes over discrete memoryless channels with feedback. Subsequently, an alternative achievability proof was obtained by Yamamoto and Itoh via a particularly simple and instructive scheme. Their idea is to alternate between a communication and a confirmation phase until the receiver detects the codeword used by the sender to acknowledge that the message is correct. We provide a converse that parallels the Yamamoto-Itoh achievability construction. Besides being simpler than the original, the proposed converse suggests that a communication and a confirmation phase are implicit in any scheme for which the probability of error decreases with the largest possible exponent. The proposed converse also makes it intuitively clear why the terms that appear in Burnashev's exponent are necessary.
Berlin Peter
Nakiboglu Baris
Rimoldi Bixio
Telatar Emre
No associations
LandOfFree
A Simple Converse of Burnashev's Reliability 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 A Simple Converse of Burnashev's Reliability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Simple Converse of Burnashev's Reliability will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-378238