Approximations for the capacity of binary input discrete memoryless channels

In this paper, we present our results on lower and upper bounds for the capacity of binary input discrete memoryless channels. These bounds also serve as good approximations for the capacity of these channels. Our results generalize previous analysis of bounds for binary input, binary output discrete memoryless channels and also constitute an extension of the new field of algebraic information theory.

[1]  Richard A. Silverman.  On binary channels and their cascades , 1955, IRE Trans. Inf. Theory.

[2]  H. Rumsey,et al.  Two Results On Binary-input Discrete Memoryless Channels , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

[3]  Ira S. Moskowitz.  An approximation of the capacity of a simple channel , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

[4]  Ira S. Moskowitz,et al.  Noisy Timing Channels with Binary Inputs and Outputs , 2006, Information Hiding.

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

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

[7]  Hermann J. Helgert,et al.  On a bound for channel capacity (Corresp.) , 1967, IEEE Trans. Inf. Theory.

[8]  Peter Harremoës,et al.  Refinements of Pinsker's inequality , 2003, IEEE Trans. Inf. Theory.

[9]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

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

[11]  J. Kemperman,et al.  On the Optimum Rate of Transmitting Information , 1969 .

[12]  Meir Feder,et al.  The uniform distribution as a universal prior , 2004, IEEE Transactions on Information Theory.

[13]  Ira S. Moskowitz,et al.  Algebraic information theory for binary channels , 2010, Theor. Comput. Sci..