The Redundancy of Multi-resolution Coding for Successively Refinable Sources
暂无分享,去创建一个
[1] Kenneth Rose,et al. Error exponents in scalable source coding , 2003, IEEE Trans. Inf. Theory.
[2] Neri Merhav,et al. Hierarchical Guessing with a Fidelity Criterion , 1999, IEEE Trans. Inf. Theory.
[3] Bixio Rimoldi,et al. Successive refinement of information: characterization of the achievable rates , 1994, IEEE Trans. Inf. Theory.
[4] Kenneth Rose,et al. Additive successive refinement , 2003, IEEE Trans. Inf. Theory.
[5] Toby Berger,et al. Rate distortion theory : a mathematical basis for data compression , 1971 .
[6] Kenneth Rose,et al. On hierarchical type covering , 2004, IEEE Transactions on Information Theory.
[7] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[8] Michelle Effros. Distortion-rate bounds for fixed- and variable-rate multiresolution source codes , 1999, IEEE Trans. Inf. Theory.
[9] G. Voronov,et al. The redundancy of successive refinement codes and codes with side information , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).
[10] R. Gray. Conditional Rate-Distortion Theory , 1972 .
[11] William Equitz,et al. Successive refinement of information , 1991, IEEE Trans. Inf. Theory.
[12] Zhen Zhang,et al. The redundancy of source coding with a fidelity criterion: 1. Known statistics , 1997, IEEE Trans. Inf. Theory.
[13] Zhen Zhang,et al. Performance analysis of network source coding algorithms , 2005 .
[14] Prakash Narayan,et al. Error exponents for successive refinement by partitioning , 1996, IEEE Trans. Inf. Theory.
[15] Neri Merhav,et al. Guessing Subject to Distortion , 1998, IEEE Trans. Inf. Theory.
[16] Zhen Zhang,et al. On the Redundancy of Lossy Source Coding with Abstract Alphabets , 1999, IEEE Trans. Inf. Theory.