论文信息 - A binary analog to the entropy-power inequality

A binary analog to the entropy-power inequality

Let (X/sub n/), (Y/sub n/) be independent stationary binary random sequences with entropy H(X), H(Y), respectively. Let h( zeta )=- zeta log zeta -(1- zeta )log(1- zeta ), 0 or= sigma (X)* sigma (Y), where sigma (Z)=h/sup -1/ (H(Z)), and alpha * beta = alpha (1- beta )+ beta (1- alpha ). When (Y/sub n/) are independent identically distributed, this reduces to Mrs. Gerber's Lemma from A.D. Wyner and J. Ziv (1973). >

Shlomo Shamai | Aaron D. Wyner | A. Wyner | S. Shamai

[1] Rudolf Ahlswede,et al. On the connection between the entropies of input and output distributions of discrete memoryless channels , 1977 .

[2] Shlomo Shamai,et al. On the capacity of binary and Gaussian channels with run-length-limited inputs , 1990, IEEE Trans. Commun..

[3] Aaron D. Wyner,et al. A theorem on the entropy of certain binary sequences and applications-II , 1973, IEEE Trans. Inf. Theory.

[4] E. Gilbert. Capacity of a burst-noise channel , 1960 .

[5] Hans S. Witsenhausen,et al. Entropy inequalities for discrete channels , 1974, IEEE Trans. Inf. Theory.

[6] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.