Channels With Cost Constraints: Strong Converse and Dispersion

Victoria Kostina, Sergio Verdú

Research output: Contribution to journalArticlepeer-review

17 Scopus citations


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 b-tilted information density, which plays a role similar to that of the d-tilted information in lossy source coding. We also analyze the fundamental limits of lossy joint-source-channel coding over channels with cost constraints.

Original languageEnglish (US)
Article number7055296
Pages (from-to)2415-2429
Number of pages15
JournalIEEE Transactions on Information Theory
Issue number5
StatePublished - May 1 2015

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


  • Converse
  • Shannon theory
  • channels with cost constraints
  • dispersion
  • finite blocklength regime
  • joint source-channel coding
  • memoryless channels
  • memoryless sources
  • strong converse


Dive into the research topics of 'Channels With Cost Constraints: Strong Converse and Dispersion'. Together they form a unique fingerprint.

Cite this