Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding

DOI10.1109/18.340451zbMath0826.94006OpenAlexW2156117587MaRDI QIDQ4850276

Kenneth Zeger, Tamás Linder, Gábor Lugosi

Publication date: 4 December 1995

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

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

zbMATH Keywords

convergence rateslarge deviation theoryuniversal lossy source codingempirical vector quantizer design

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Coding theorems (Shannon theory) (94A24) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Related Items (13)

Convergence of the $k$-Means Minimization Problem using $\Gamma$-Convergence ⋮ Fast rates for empirical vector quantization ⋮ Strong Consistency of ReducedK-means Clustering ⋮ Statistical learning guarantees for compressive clustering and compressive mixture modeling ⋮ On Hölder fields clustering ⋮ Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases ⋮ \(L_1\)-quantization and clustering in Banach spaces ⋮ A notion of stability for \(k\)-means clustering ⋮ Dimensionality-Dependent Generalization Bounds for k-Dimensional Coding Schemes ⋮ Quantile-based clustering ⋮ Consistency of data-driven histogram methods for density estimation and classification ⋮ On strong consistency of kernel \(k\)-means: a Rademacher complexity approach ⋮ Nonasymptotic bounds for vector quantization in Hilbert spaces

This page was built for publication: Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding