Erasure/List Exponents for Slepian–Wolf Decoding
暂无分享,去创建一个
[1] Aaron B. Wagner,et al. Improved Source Coding Exponents via Witsenhausen's Rate , 2011, IEEE Transactions on Information Theory.
[2] Wei Yu,et al. Rateless Slepian-Wolf Codes , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..
[3] Stark C. Draper,et al. Compound conditional source coding, Slepian-Wolf list decoding, and applications to media coding , 2007, 2007 IEEE International Symposium on Information Theory.
[4] Neri Merhav,et al. Statistical Physics and Information Theory , 2010, Found. Trends Commun. Inf. Theory.
[5] D. A. Bell,et al. Information Theory and Reliable Communication , 1969 .
[6] Emre Telatar,et al. Multi-access communications with decision feedback decoding , 1992 .
[7] G. David Forney,et al. Exponential error bounds for erasure, list, and decision feedback schemes , 1968, IEEE Trans. Inf. Theory.
[8] M. Mézard,et al. Information, Physics, and Computation , 2009 .
[9] Te Sun Han,et al. Universal coding for the Slepian-Wolf data compression system and the strong converse theorem , 1994, IEEE Trans. Inf. Theory.
[10] Jack K. Wolf,et al. Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.
[11] Imre Csiszár,et al. Towards a general theory of source networks , 1980, IEEE Trans. Inf. Theory.
[12] Neri Merhav,et al. Exact Random Coding Exponents for Erasure Decoding , 2011, IEEE Transactions on Information Theory.
[13] Imre Csiszár. Linear codes for sources and source networks: Error exponents, universal coding , 1982, IEEE Trans. Inf. Theory.
[14] Imre Csiszár,et al. Graph decomposition: A new key to coding theorems , 1981, IEEE Trans. Inf. Theory.
[15] Neri Merhav. Erasure/List Exponents for Slepian-Wolf Decoding , 2014, IEEE Trans. Inf. Theory.