A simple converse of Burnashev's reliability function

  • Authors:
  • Peter Berlin;Baris Nakiboǧlu;Bixio Rimoldi;Emre Telatar

  • Affiliations:
  • Investment Technology Group, Boston, MA and School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland;Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA;School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland;School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2009

Quantified Score

Hi-index 754.96

Visualization

Abstract

In a remarkable paper published in 1976, Burnashev determined the reliability function of variable-length block codes over discrete memoryless channels (DMCs) 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.