Bounds on entropy in a guessing game

DOI10.1109/18.904564MaRDI QIDQ4544499zbMATH OpenOpenAlexFDO

Authors Alfredo De Santis, A. Giorgio Gaggia, Ugo Vaccaro

Publication date 4 August 2002

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

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

zbMATH Keywords

cryptanalysisentropyguessingprobability distribution

Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15) Measures of information, entropy (94A17) Cryptography (94A60)

Recommendations

• Playing games with bounded entropy
• Guesswork, Large Deviations, and Shannon Entropy
• Graph Guessing Games and Non-Shannon Information Inequalities
• Entropy concentration and the empirical coding game
• Some bounds on entropy measures in information theory
• Optimal guessing under nonextensive framework and associated moment bounds
• Information and entropy. A double game with probabilities
• Bounds on general entropy measures
• scientific article; zbMATH DE number 1804111
• Estimates of entropy numbers in probabilistic setting

Cited in

(4)

• scientific article; zbMATH DE number 1583935 (Why is no real title available?)
• Guesswork
• Optimal guessing under nonextensive framework and associated moment bounds
• Moderate deviation principle for guesswork

This page was built for publication: Bounds on entropy in a guessing game

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