A Simple Converse of Burnashev's Reliability
<|reference_start|>A Simple Converse of Burnashev's Reliability: 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.<|reference_end|>
@article{berlin2006a,
    title={A Simple Converse of Burnashev's Reliability},
    author={Peter Berlin, Baris Nakiboglu, Bixio Rimoldi, Emre Telatar},
    journal={IEEE Transactions on Information Theory, 55(7):3074-3080, July
  2009},
    year={2006},
    doi={10.1109/TIT.2009.2021322},
    archivePrefix={arXiv},
    eprint={cs/0610145},
    primaryClass={cs.IT math.IT}
}