论文信息 - On list size exponents in rate-distortion coding - 字舞流文

On list size exponents in rate-distortion coding

We characterize and investigate the highest achievable exponential growth rate of the expected number of rate-distortion codewords that are within a certain distance from a given source vector.

[1] Thomas M. Cover,et al. Elements of Information Theory , 2005 .

[2] Toby Berger,et al. Rate distortion theory : a mathematical basis for data compression , 1971 .

[3] Katalin Marton,et al. Error exponent for source coding with a fidelity criterion , 1974, IEEE Trans. Inf. Theory.

[4] Rudolf Ahlswede,et al. Erasure, list, and detection zero-error capacities for low noise and a relation to identification , 1996, IEEE Trans. Inf. Theory.

[5] Richard E. Blahut,et al. Principles and practice of information theory , 1987 .

[6] Emre Telatar. Zero-error list capacities of discrete memoryless channels , 1997, IEEE Trans. Inf. Theory.