Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Açık Bilim Politikası
Açık Bilim Politikası
Frequently Asked Questions
Frequently Asked Questions
Browse
Browse
By Issue Date
By Issue Date
Authors
Authors
Titles
Titles
Subjects
Subjects
Communities & Collections
Communities & Collections
A Simple Converse of Burnashev's Reliability Function
Download
index.pdf
Date
2009-07-01
Author
Berlin, Peter
Nakiboğlu, Barış
Rimoldi, Bixio
Telatar, Emre İ
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
7
views
10
downloads
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.
Subject Keywords
Library and Information Sciences
,
Information Systems
,
Computer Science Applications
URI
https://hdl.handle.net/11511/48630
Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
DOI
https://doi.org/10.1109/tit.2009.2021322
Collections
Department of Electrical and Electronics Engineering, Article