Rate-distortion in near-linear time
暂无分享,去创建一个
[1] Ioannis Kontoyiannis,et al. An implementable lossy version of the Lempel-Ziv algorithm - Part I: Optimality for memoryless sources , 1999, IEEE Trans. Inf. Theory.
[2] Sergio Verdú,et al. Nonlinear Sparse-Graph Codes for Lossy Compression , 2009, IEEE Transactions on Information Theory.
[3] H. Yamamoto,et al. A coding theorem for lossy data compression by LDPC codes , 2002, Proceedings IEEE International Symposium on Information Theory,.
[4] Katalin Marton,et al. Error exponent for source coding with a fidelity criterion , 1974, IEEE Trans. Inf. Theory.
[5] Zhen Zhang,et al. The redundancy of source coding with a fidelity criterion: 1. Known statistics , 1997, IEEE Trans. Inf. Theory.
[6] R. Zecchina,et al. Message-Passing Algorithms for Non-Linear Nodes and Data Compression , 2005, Complexus.
[7] Martin J. Wainwright,et al. Lossy source encoding via message-passing and decimation over generalized codewords of LDGM codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[8] S. Verdu,et al. Nonlinear Sparse-Graph Codes for Lossy Compression of Discrete Nonredundant Sources , 2007, 2007 IEEE Information Theory Workshop.
[9] Martin J. Wainwright,et al. Low density codes achieve the rate-distortion bound , 2006, Data Compression Conference (DCC'06).
[10] Shigeki Miyake,et al. Lossy Data Compression over Zq by LDPC Code , 2006, 2006 IEEE International Symposium on Information Theory.