Asymptotically Sufficient Partitions and Quantizations

DOI10.1109/TIT.2006.885495MaRDI QIDQ3548073zbMATH OpenOpenAlexFDO

Authors Igor Vajda, Friedrich Liese, Domingo Morales

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.885495

Mathematics Subject Classification ID

Sampling theory in information and communication theory (94A20)

Recommendations

• On asymptotic sufficiency and optimality of quantizations
• On convergence of information contained in quantized observations
• Asymptotic quantization of probability distributions
• On efficiency of estimation and testing with data quantized to fixed number of cells
• Foundations of quantization for probability distributions

Cited in

(7)

• Quantitative versions of combinatorial partition theorems.
• Optimal quantization of the support of a continuous multivariate distribution based on mutual information
• Limits of Bayesian decision related quantities of binomial asset price models
• Optimal quantization for the one-dimensional uniform distribution with Rényi- -entropy constraints
• β-Informational Sufficient Partition
• On convergence of information contained in quantized observations
• Information divergence estimation based on data-dependent partitions

This page was built for publication: Asymptotically Sufficient Partitions and Quantizations

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