Do optimal entropy-constrained quantizers have a finite or infinite number of codewords?
暂无分享,去创建一个
[1] Tamás Linder,et al. Optimal entropy-constrained scalar quantization of a uniform source , 2000, IEEE Trans. Inf. Theory.
[2] Tamás Linder,et al. A Lagrangian formulation of Zador's entropy-constrained quantization theorem , 2002, IEEE Trans. Inf. Theory.
[3] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[4] Dudley,et al. Real Analysis and Probability: Measurability: Borel Isomorphism and Analytic Sets , 2002 .
[5] Tamás Linder,et al. Mismatch in high-rate entropy-constrained vector quantization , 2003, IEEE Trans. Inf. Theory.
[6] R. Ladner. Entropy-constrained Vector Quantization , 2000 .
[7] Neri Merhav,et al. Source coding exponents for zero-delay coding with finite memory , 2003, IEEE Trans. Inf. Theory.
[8] N. L. Johnson,et al. Continuous Univariate Distributions. , 1995 .
[9] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[10] Tamás Linder,et al. On the structure of optimal entropy-constrained scalar quantizers , 2002, IEEE Trans. Inf. Theory.
[11] Toby Berger,et al. Fixed-slope universal lossy data compression , 1997, IEEE Trans. Inf. Theory.