On the Duality and Difference Between Slepian-Wolf Coding and Channel Coding
暂无分享,去创建一个
Jun Chen | A. Jagmohan | Da-ke He | A. Jagmohan | L. A. Lastras-Montaño | Jun Chen | Dake He | L.A. Lastras-Montano
[1] Frederick Jelinek,et al. Evaluation of expurgated bound exponents , 1968, IEEE Trans. Inf. Theory.
[2] R. Gallager. Information Theory and Reliable Communication , 1968 .
[3] R. A. McDonald,et al. Noiseless Coding of Correlated Information Sources , 1973 .
[4] Suguru Arimoto,et al. On the converse to the coding theorem for discrete memoryless channels (Corresp.) , 1973, IEEE Trans. Inf. Theory.
[5] Gunter Dueck,et al. Reliability function of a discrete memoryless channel at rates above capacity (Corresp.) , 1979, IEEE Trans. Inf. Theory.
[6] Imre Csiszár,et al. Towards a general theory of source networks , 1980, IEEE Trans. Inf. Theory.
[7] Imre Csiszár,et al. Graph decomposition: A new key to coding theorems , 1981, IEEE Trans. Inf. Theory.
[8] Imre Csiszár. Linear codes for sources and source networks: Error exponents, universal coding , 1982, IEEE Trans. Inf. Theory.
[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] Jun Chen,et al. On the Codebook-Level Duality Between Slepian-Woif Coding and Channel Coding , 2007, 2007 Information Theory and Applications Workshop.
[11] Jun Chen,et al. On the Redundancy-Error Tradeoff in Slepian-Wolf Coding and Channel Coding , 2007, 2007 IEEE International Symposium on Information Theory.