A theorem on the entropy of certain binary sequences and applications--I
From MaRDI portal
Publication:4767220
DOI10.1109/TIT.1973.1055107zbMath0279.94014OpenAlexW3140053156MaRDI QIDQ4767220
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
Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (10)
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 ⋮ Multiple-user communication ⋮ On the \(\Phi \)-stability and related conjectures ⋮ Upper concave envelopes and auxiliary random variables ⋮ 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 ⋮ Common Information, Noise Stability, and Their Extensions
This page was built for publication: A theorem on the entropy of certain binary sequences and applications--I
