Entropy lower bounds related to a problem of universal coding and prediction

MaRDI QIDQ5433704zbMATH OpenFDO

Authors Flemming Topsøe

Publication date 9 January 2008

Full work available at URL https://eudml.org/doc/128775, http://www.emis.de/journals/JIPAM/article676.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

entropyindex of coincidencemeasure of roughnessRényi entropyuniversal codinguniversal prediction

Mathematics Subject Classification ID

Information theory (general) (94A15) Measures of information, entropy (94A17)

Recommendations

• Inequalities between entropy and index of coincidence derived from information diagrams
• On a generalized entropy and a coding theorem
• Bounds for indices of coincidence and entropies
• Some bounds on entropy measures in information theory
• Bounds for some entropies and special functions

Cited in

(5)

• Encoding Tasks and Rényi Entropy
• The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
• Prediction and Entropy of Printed English
• Inequalities between entropy and index of coincidence derived from information diagrams
• Bounds for indices of coincidence and entropies

This page was built for publication: Entropy lower bounds related to a problem of universal coding and prediction

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