Universal Divergence Estimation for Finite-Alphabet Sources

DOI10.1109/TIT.2006.878182MaRDI QIDQ3547923zbMATH OpenFDO

Authors Haixiao Cai, Sanjeev R. Kulkarni, Sergio Verdú

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

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

Recommendations

• Universal estimation of information measures for analog sources
• Universal Entropy Estimation Via Block Sorting
• scientific article; zbMATH DE number 1087963
• Divergence Estimation of Continuous Distributions Based on Data-Dependent Partitions
• There is no universal source code for an infinite source alphabet

Cited in

(9)

• Non-parametric change-point estimation using string matching algorithms
• Relative entropy via non-sequential recursive pair substitution
• Thermodynamic Gibbs Formalism and Information Theory
• Universal Entropy Estimation Via Block Sorting
• Divergence Estimation of Continuous Distributions Based on Data-Dependent Partitions
• Universal estimation of information measures for analog sources
• A universal model based on minimax average divergence
• There is no universal source code for an infinite source alphabet
• scientific article; zbMATH DE number 1087963 (Why is no real title available?)

This page was built for publication: Universal Divergence Estimation for Finite-Alphabet Sources

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