A Lagrangian formulation of Zador's entropy-constrained quantization theorem
From MaRDI portal
Publication:4544822
Prefix, length-variable, comma-free codes (94A45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Sampling theory in information and communication theory (94A20) Rate-distortion theory in information and communication theory (94A34)
Recommendations
- Lagrangian Vector Quantization With Combined Entropy and Codebook Size Constraints
- Asymptotic entropy-constrained performance of tessellating and universal randomized lattice quantization
- Lagrangian empirical design of variable-rate vector quantizers: consistency and convergence rates
- Conditional entropy-constrained vector quantization: high-rate theory and design algorithms
- New results on optimal entropy-constrained quantization
Cited in
(10)- Lagrangian Vector Quantization With Combined Entropy and Codebook Size Constraints
- Asymptotic formulae for coding problems and intermediate optimization problems: a review
- Conditional entropy-constrained vector quantization: high-rate theory and design algorithms
- On adjusted Viterbi training
- New results on optimal entropy-constrained quantization
- A Zador-like formula for quantizers based on periodic tilings
- Error bounds for high-resolution quantization with Rényi-\(\alpha\)-entropy constraints
- Lagrangian empirical design of variable-rate vector quantizers: consistency and convergence rates
- Do optimal entropy-constrained quantizers have a finite or infinite number of codewords?
- Asymptotic entropy-constrained performance of tessellating and universal randomized lattice quantization
This page was built for publication: A Lagrangian formulation of Zador's entropy-constrained quantization theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544822)