A binary analog to the entropy-power inequality
Shamai, S.; Wyner, A.D.
Information Theory, IEEE Transactions on
Volume 36, Issue 6, Nov 1990 Page(s):1428 - 1430
Digital Object Identifier   10.1109/18.59938
Summary:Let {X_n}, {Y_n} 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 z_n=X_n⊕Y_n , where ⊕ denotes modulo-2 addition. The following analog of the entropy-power inequality provides a lower bound on H(Z ), the entropy of {Z_n}: σ(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)

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.