Codecell convexity in optimal entropy-constrained vector quantization
From MaRDI portal
Recommendations
- On Codecell Convexity of Optimal Multiresolution Scalar Quantizers for Continuous Sources
- On the structure of optimal entropy-constrained scalar quantizers
- Conditional entropy-constrained vector quantization: high-rate theory and design algorithms
- Convergence of Vector Quantizers with Applications to Optimal Quantization
- Lagrangian Vector Quantization With Combined Entropy and Codebook Size Constraints
- A Rigorous Approach to High-Resolution Entropy-Constrained Vector Quantization
- New results on optimal entropy-constrained quantization
- Entropy-constrained trellis-coded quantization
- scientific article; zbMATH DE number 1135099
- A contribution to optimal codebook design in vector quantization
Cited in
(8)- Error bounds for high-resolution quantization with Rényi-\(\alpha\)-entropy constraints
- Design of Information Channels for Optimization and Stabilization in Networked Control
- Constrained-storage vector quantization with a universal codebook
- Do optimal entropy-constrained quantizers have a finite or infinite number of codewords?
- Convergence of Vector Quantizers with Applications to Optimal Quantization
- On the structure of optimal entropy-constrained scalar quantizers
- Deterministic Annealing for Entropy-Constrained Vector Quantizer Design
- Optimal vector quantization in terms of Wasserstein distance
This page was built for publication: Codecell convexity in optimal entropy-constrained vector quantization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546965)
