Channels With Cost Constraints: Strong Converse and Dispersion

DOI10.1109/TIT.2015.2409261MaRDI QIDQ2978615zbMATH OpenOpenAlexFDO

Authors Victoria Kostina, Sergio Verdú

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1401.5124

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Abstract: This paper shows the strong converse and the dispersion of memoryless channels with cost constraints and performs refined analysis of the third order term in the asymptotic expansion of the maximum achievable channel coding rate, showing that it is equal to $frac12fraclognn$ in most cases of interest. The analysis is based on a non-asymptotic converse bound expressed in terms of the distribution of a random variable termed the $mathsfb$-tilted information density, which plays a role similar to that of the $mathsfd$-tilted information in lossy source coding. We also analyze the fundamental limits of lossy joint-source-channel coding over channels with cost constraints.

Recommendations

• Coding for channels with cost constraints
• scientific article; zbMATH DE number 2104030
• A practical method for approaching the channel capacity of constrained channels
• Tight lower bound for the channel assignment problem
• Tight lower bound for the channel assignment problem
• Structural Properties of Optimal Transmission Policies Over a Randomly Varying Channel
• scientific article; zbMATH DE number 804038
• On Properties of the Support of Capacity-Achieving Distributions for Additive Noise Channel Models With Input Cost Constraints
• scientific article; zbMATH DE number 4201998
• Achievable rates for a constrained Gaussian channel

Cited in

(2)

• Finite blocklength analysis of energy harvesting channels
• The Augustin capacity and center

This page was built for publication: Channels With Cost Constraints: Strong Converse and Dispersion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978615)