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

133
views

84
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

Suggestions

OpenMETU
Core

The Renyi Capacity and Center Nakiboğlu, Barış (Institute of Electrical and Electronics Engineers (IEEE), 2019-02-01) Renyi's information measures-the Renyi information, mean, capacity, radius, and center-are analyzed relying on the elementary properties of the Renyi divergence and the power means. The van Erven-Harremoes conjecture is proved for any positive order and for any set of probability measures on a given measurable space and a generalization of it is established for the constrained variant of the problem. The finiteness of the order alpha Renyi capacity is shown to imply the continuity of the Renyi capacity on (...
An improvement on the bounds of Weil exponential sums over Gallois rings with some applications Ling, S; Özbudak, Ferruh (Institute of Electrical and Electronics Engineers (IEEE), 2004-10-01) We present an upper bound for Weil-type exponential sums over Galois rings of characteristic p(2) which improves on the analog of the Weil-Carlitz-Uchiyama bound for Galois rings obtained by Kumar, Helleseth, and Calderbank. A more refined bound, expressed in terms of genera of function fields, and an analog of McEliece's theorem on the divisibility of the homogeneous weights of codewords in trace codes over Z(p)2, are also derived. These results lead to an improvement on the estimation of the minimum dista...
A state prediction scheme for discrete time nonlinear dynamic systems Demirbaş, Kerim (Informa UK Limited, 2007-01-01) A state prediction scheme is proposed for discrete time nonlinear dynamic systems with non-Gaussian disturbance and observation noises. This scheme is based upon quantization, multiple hypothesis testing, and dynamic programming. Dynamic models of the proposed scheme are as general as dynamic models of particle predictors, whereas the nonlinear models of the extended Kalman (EK) predictor are linear with respect to the disturbance and observation noises. The performance of the proposed scheme is compared wi...
Constructing linear unequal error protection codes from algebraic curves Özbudak, Ferruh (Institute of Electrical and Electronics Engineers (IEEE), 2003-06-01) We show that the concept of "generalized algebraic geometry codes" which was recently introduced by Xing, Niederreiter, and Lam gives a natural framework for constructing linear unequal error protection codes.
Error exponents for variable-length block codes with feedback and cost constraints Nakiboğlu, Barış (Institute of Electrical and Electronics Engineers (IEEE), 2008-03-01) Variable-length block-coding schemes are investigated for discrete memoryless channels with ideal feedback under cost constraints. Upper and lower bounds are found for the minimum achievable probability of decoding error P-e,P-min as a function of constraints R, P, and T on the transmission rate, average cost, and average block length, respectively. For given R and P, the lower and upper bounds to the exponent -(In P-e,P-min)/(T) over bar are asymptotically equal as (T) over bar -> infinity. The resulting r...

Citation Formats

P. Berlin, B. Nakiboğlu, B. Rimoldi, and E. İ. Telatar, “A Simple Converse of Burnashev’s Reliability Function,” IEEE TRANSACTIONS ON INFORMATION THEORY, pp. 3074–3080, 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/48630.