On the redundancy of trellis lossy source coding
暂无分享,去创建一个
[1] R. Gray. Entropy and Information Theory , 1990, Springer New York.
[2] Toby Berger,et al. Rate distortion theory : a mathematical basis for data compression , 1971 .
[3] Zhen Zhang,et al. On the Redundancy of Lossy Source Coding with Abstract Alphabets , 1999, IEEE Trans. Inf. Theory.
[4] Zhen Zhang,et al. The redundancy of source coding with a fidelity criterion: 1. Known statistics , 1997, IEEE Trans. Inf. Theory.
[5] Michelle Effros,et al. A vector quantization approach to universal noiseless coding and quantization , 1996, IEEE Trans. Inf. Theory.
[6] Allen Gersho,et al. Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.
[7] Robert G. Gallager,et al. A simple derivation of the coding theorem and some applications , 1965, IEEE Trans. Inf. Theory.
[8] Toby Berger,et al. Review of Information Theory: Coding Theorems for Discrete Memoryless Systems (Csiszár, I., and Körner, J.; 1981) , 1984, IEEE Trans. Inf. Theory.
[9] Robert B. Ash,et al. Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.
[10] Tamás Linder,et al. Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding , 1994, IEEE Trans. Inf. Theory.
[11] Zhen Zhang,et al. An On-Line Universal Lossy Data Compression Algorithm via Continuous Codebook Refinement - Part III: Redundancy Analysis , 1998, IEEE Trans. Inf. Theory.
[12] Frederick Jelinek. Tree encoding of memoryless time-discrete sources with a fidelity criterion , 1969, IEEE Trans. Inf. Theory.
[13] Anurag Bist,et al. of Book , 2022 .
[14] Robert M. Gray,et al. Sliding-block source coding , 1975, IEEE Trans. Inf. Theory.
[15] Andrew J. Viterbi,et al. Trellis Encoding of memoryless discrete-time sources with a fidelity criterion , 1974, IEEE Trans. Inf. Theory.
[16] R. J. Pilc. The transmission distortion of a source as a function of the encoding block length , 1968 .
[17] Bin Yu,et al. A rate of convergence result for a universal D-semifaithful code , 1993, IEEE Trans. Inf. Theory.
[18] Zhen Zhang,et al. An on-line universal lossy data compression algorithm via continuous codebook refinement - Part II. Optimality for phi-mixing source models , 1996, IEEE Trans. Inf. Theory.
[19] Robert M. Gray,et al. Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterion , 1977, IEEE Trans. Inf. Theory.
[20] Jim K. Omura,et al. A coding theorem for discrete-time sources , 1973, IEEE Trans. Inf. Theory.