Scheduled System Maintenance on December 17th, 2014:
IEEE Xplore will be upgraded between 2:00 and 5:00 PM EST (18:00 - 21:00) UTC. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

A binary analog to the entropy-power inequality

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shamai, S. ; AT&T Bell Lab., Murray Hill, NJ, USA ; Wyner, A.D.

Let {Xn}, {Yn} be independent stationary binary random sequences with entropy H( X), H(Y), respectively. Let h(ζ)=-ζlogζ-(1-ζ)log(1-ζ), 0⩽ζ⩽1/2, be the binary entropy function and let σ(X)=h-1 (H(X)), σ(Y)=h-1 (H(Y)). Let zn=XnYn , where ⊕ denotes modulo-2 addition. The following analog of the entropy-power inequality provides a lower bound on H(Z ), the entropy of {Zn}: σ(Z)⩾σ(X)*σ(Y), where σ(Z)=h-1 (H(Z)), and α*β=α(1-β)+β(1-α). When {Y n} are independent identically distributed, this reduces to Mrs. Gerber's Lemma from A.D. Wyner and J. Ziv (1973)

Published in:

Information Theory, IEEE Transactions on  (Volume:36 ,  Issue: 6 )