Networking

Channels with Cost Constraints: Strong Converse and Dispersion

Download Now Free registration required

Executive Summary

This paper shows the strong converse and the dispersion of memory-less channels with cost constraints. The analysis is based on a new non-asymptotic 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 information density in channel coding without cost constraints. The authors also analyze the fundamental limits of lossy joint-source-channel coding over channels with cost constraints. This paper is concerned with the maximum channel coding rate achievable at average error probability.

  • Format: PDF
  • Size: 206.76 KB