The Entropy Power Inequality and Mrs. Gerber's Lemma for Groups of Order <inline-formula> <tex-math notation="TeX">${2^{n}}$ </tex-math></inline-formula>

DOI10.1109/TIT.2014.2317692zbMath1360.94156WikidataQ124798800 ScholiaQ124798800MaRDI QIDQ2986248

Venkat Anantharam, Varun Jog

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Related Items (5)

The norm of the Fourier transform on compact or discrete abelian groups ⋮ Removing the field size loss from Duc et al.'s conjectured bound for masked encodings ⋮ Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model ⋮ Inequalities for overdamped fluctuating systems ⋮ Entropy Inequalities for Sums in Prime Cyclic Groups

This page was built for publication: The Entropy Power Inequality and Mrs. Gerber's Lemma for Groups of Order <inline-formula> <tex-math notation="TeX">${2^{n}}$ </tex-math></inline-formula>