A theorem on the entropy of certain binary sequences and applications--I

DOI10.1109/TIT.1973.1055107MaRDI QIDQ4767220zbMATH OpenOpenAlexFDO

Authors Jacob Ziv, Aaron D. Wyner

Publication date 1973

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

Full work available at URL https://doi.org/10.1109/tit.1973.1055107

Mathematics Subject Classification ID

Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(11)

• Multiple-user communication
• Capacity region of degraded broadcast channels with feedback
• Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube
• Entropy inequalities for sums in prime cyclic groups
• Upper concave envelopes and auxiliary random variables
• Common Information, Noise Stability, and Their Extensions
• Non-linear log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems
• 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
• On the \(\Phi \)-stability and related conjectures
• Formal security proofs via Doeblin coefficients: optimal side-channel factorization from noisy leakage to random probing

This page was built for publication: A theorem on the entropy of certain binary sequences and applications--I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4767220)