Bounds on the mutual informations of the binary sums of Bernoulli random variables

Authors:
Payam Pakzad;Venkat Anantharam;Amin Shokrollahi
Affiliations:
Qualcomm Inc., Santa Clara, CA;EECS Department, U.C.Berkeley, Berkeley, CA;Algorithmics Laboratory, EPFL, Lausanne, Switzerland
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 3
Cited 0

Elements of information theory

Elements of information theory
Raptor codes

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Modern Coding Theory

Modern Coding Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present some simple information inequalities on binary sums of Bernoulli random variables that appear to be new. Consequences for information across binary input memoryless symmetric channels are also presented.