Variable-Rate Channel Capacity

This paper introduces the notions of variable-to-fixed and fixed-to-variable channel capacity, without feedback. For channels that satisfy the strong converse, these notions coincide with the conventional Shannon capacity. For channels that do not behave ergodically, the conventional fixed-rate Shannon capacity only depends on least-favorable channel conditions, while the variable-rate capacity notions are able to capture the whole range of channel states and their likelihood, even in the absence of any side information about channel state at the transmitter. Particular emphasis is placed on memoryless channels that are governed by finitely valued states. We show that (single-user) variable-to-fixed channel capacity is intimately connected to the capacity region of broadcast channels with degraded message sets, and we give an expression for the fixed-to-variable capacity.

[1]  Emre Telatar,et al.  Variable length coding over an unknown channel , 2006, IEEE Transactions on Information Theory.

[2]  Shlomo Shamai,et al.  A broadcast strategy for the Gaussian slowly fading channel , 1997, Proceedings of IEEE International Symposium on Information Theory.

[3]  Abbas El Gamal,et al.  The capacity region of a class of three-receiver broadcast channels with degraded message sets , 2007, IEEE Transactions on Information Theory.

[4]  Konrad Jacobs.  Almost periodic sources and channels , 1967 .

[5]  A. Sridharan.  Broadcast Channels , 2022 .

[6]  Andrea J. Goldsmith,et al.  Capacity Definitions of General Channels with Receiver Side Information , 2007, 2007 IEEE International Symposium on Information Theory.

[7]  M. Feder,et al.  Static broadcasting , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[8]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[9]  D. Luenberger.  Optimization by Vector Space Methods , 1968 .

[10]  V. Strassen,et al.  Me\fehler und Information , 1964 .

[11]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[12]  Madhu Sudan,et al.  Priority encoding transmission , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[13]  Simone Severini.  Channel Capacity , 2011 .

[14]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[15]  A~nsw~dr.  The Weak Capacity of Averaged Channels , 1967 .

[16]  Shlomo Shamai,et al.  A broadcast approach for a single-user slowly fading MIMO channel , 2003, IEEE Trans. Inf. Theory.

[17]  Richard D. Wesel,et al.  Optimal Transmission Strategy and Explicit Capacity Region for Broadcast Z Channels , 2008, IEEE Transactions on Information Theory.

[18]  L. Schmetterer.  Zeitschrift fur Wahrscheinlichkeitstheorie und Verwandte Gebiete. , 1963 .

[19]  C. L. Chen.  On a (145, 32) binary cyclic code , 1999, IEEE Trans. Inf. Theory.

[20]  Shlomo Shamai.  A broadcast approach for the multiple-access slow fading channel , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[21]  Meir Feder,et al.  Achieving the Empirical Capacity Using Feedback: Memoryless Additive Models , 2009, IEEE Transactions on Information Theory.

[22]  Sergio Verdú,et al.  A general formula for channel capacity , 1994, IEEE Trans. Inf. Theory.

[23]  Suhas N. Diggavi,et al.  Successive Refinement Via Broadcast: Optimizing Expected Distortion of a Gaussian Source Over a Gaussian Fading Channel , 2008, IEEE Transactions on Information Theory.

[24]  Rudolf Ahlswede,et al.  Two contributions to information theory , 1975 .

[25]  Andrea J. Goldsmith,et al.  Distortion Minimization in Gaussian Layered Broadcast Coding With Successive Refinement , 2007, IEEE Transactions on Information Theory.

[26]  Andrea J. Goldsmith,et al.  Minimum Expected Distortion in Gaussian Layered Broadcast Coding with Successive Refinement , 2007, 2007 IEEE International Symposium on Information Theory.

[27]  Shlomo Shamai,et al.  Fountain Capacity , 2006, IEEE Transactions on Information Theory.

[28]  David Tse,et al.  A Broadcast Approach to Multiple Access with Random States , 2007, 2007 IEEE International Symposium on Information Theory.

[29]  Chandra Nair,et al.  On 3-receiver broadcast channels with 2-degraded message sets , 2009, 2009 IEEE International Symposium on Information Theory.

[30]  Hiroki Koga,et al.  Information-Spectrum Methods in Information Theory , 2002 .

[31]  János Körner,et al.  General broadcast channels with degraded message sets , 1977, IEEE Trans. Inf. Theory.

[32]  Stephane Musy.  Variable Length Codes for Degraded Broadcast Channels , 2007, 2007 IEEE International Symposium on Information Theory.

[33]  Sekhar Tatikonda,et al.  The Capacity of Channels With Feedback , 2006, IEEE Transactions on Information Theory.

[34]  H. Vincent Poor,et al.  Variable-length coding with feedback in the non-asymptotic regime , 2010, 2010 IEEE International Symposium on Information Theory.

[35]  Sergio Verdú,et al.  Approximation theory of output statistics , 1993, IEEE Trans. Inf. Theory.

[36]  Fady Alajaji,et al.  Optimistic Shannon coding theorems for arbitrary single-user systems , 1999, IEEE Trans. Inf. Theory.

[37]  Brendan J. Frey,et al.  Rateless Coding for Arbitrary Channel Mixtures With Decoder Channel State Information , 2009, IEEE Transactions on Information Theory.

[38]  A. Goldsmith,et al.  Capacity definitions and coding strategies for general channels with receiver side information , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).