On channel capacity per unit cost

Memoryless communication channels with arbitrary alphabets where each input symbol is assigned a cost are considered. The maximum number of bits that can be transmitted reliably through the channel per unit cost is studied. It is shown that, if the input alphabet contains a zero-cost symbol, then the capacity per unit cost admits a simple expression as the maximum normalized divergence between two conditional output distributions. The direct part of this coding theorem admits a constructive proof via Stein's lemma on the asymptotic error probability of binary hypothesis tests. Single-user, multiple-access, and interference channels are studied. >

[1]  Mark H. A. Davis,et al.  Capacity and cutoff rate for Poisson-type channels , 1980, IEEE Trans. Inf. Theory.

[2]  R. Gallager.  ENERGY LIMITED CHANNELS : CODING , MULTIACCESS , AND SPREAD SPECTRUM * * ABSTRACT , 1987 .

[3]  A. D. Wyner,et al.  Capacity and error exponent for the direct detection photon channel. II , 1988 .

[4]  Amiel Feinstein,et al.  Information and information stability of random variables and processes , 1964 .

[5]  S. Kullback,et al.  A lower bound for discrimination information in terms of variation (Corresp.) , 1967, IEEE Trans. Inf. Theory.

[6]  Masud Mansuripur,et al.  Introduction to information theory , 1986 .

[7]  Solomon Kullback,et al.  Information Theory and Statistics , 1970, The Mathematical Gazette.

[8]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[9]  Masakazu Jimbo,et al.  An Iteration Method for Calculating the Relative Capacity , 1979, Inf. Control..

[10]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[11]  Solomon Kullback,et al.  Correction to A Lower Bound for Discrimination Information in Terms of Variation , 1970, IEEE Trans. Inf. Theory.

[12]  I. Csiszár.  $I$-Divergence Geometry of Probability Distributions and Minimization Problems , 1975 .

[13]  Aaron D. Wyner,et al.  Capacity and error-exponent for the direct detection photon channel-Part II , 1988, IEEE Trans. Inf. Theory.

[14]  P. Brémaud.  Point Processes and Queues , 1981 .

[15]  Richard E. Blahut,et al.  Principles and practice of information theory , 1987 .

[16]  J. Pierce,et al.  Optical Channels: Practical Limits with Photon Counting , 1978, IEEE Trans. Commun..

[17]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[18]  G. Longo,et al.  The theory of information and coding: A mathematical framework for communication , 1979, Proceedings of the IEEE.

[19]  A. El Gamal,et al.  Multiple user information theory , 1980, Proceedings of the IEEE.

[20]  Bernd Meister,et al.  On the Capacity of a Discrete, Constant Channel , 1967, Inf. Control..

[21]  P. Brémaud.  Point processes and queues, martingale dynamics , 1983 .