Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published May 2015 | public
Journal Article Open

Channels With Cost Constraints: Strong Converse and Dispersion


This paper shows the strong converse and the dispersion of memoryless channels with cost constraints and performs a refined analysis of the third-order term in the asymptotic expansion of the maximum achievable channel coding rate, showing that it is equal to (1/2)((log n)/n) in most cases of interest. The analysis is based on a nonasymptotic converse bound expressed in terms of the distribution of a random variable termed the mathsf b -tilted information density, which plays a role similar to that of the mathsf d -tilted information in lossy source coding. We also analyze the fundamental limits of lossy joint-source-channel coding over channels with cost constraints.

Additional Information

© 2015 IEEE. Date of Publication: 05 March 2015. Date of Current Version: 17 April 2015. Manuscript received March 15, 2013; revised May 16, 2014; accepted January 22, 2015. Date of publication March 5, 2015; date of current version April 17, 2015. This work was supported in part by the National Science Foundation (NSF) under Grant CCF-1016625 and in part by the Center for Science of Information, an NSF Science and Technology Center under Grant CCF-0939370. This work was presented in part at 2013 IEEE International Symposium on Information Theory. The authors thank the referees for their unusually thorough reviews, which are reflected in the final version.

Attached Files

Submitted - 1401.5124v2.pdf


Files (375.6 kB)
Name Size Download all
375.6 kB Preview Download

Additional details

August 20, 2023
August 20, 2023