Linear codes for sources and source networks: Error exponents, universal coding
暂无分享,去创建一个
[1] R. Dobrushin. Asymptotic Optimality of Group and Systematic Codes for Some Channels , 1963 .
[2] János Körner,et al. How to encode the modulo-two sum of binary sources (Corresp.) , 1979, IEEE Trans. Inf. Theory.
[3] Rudolf Ahlswede,et al. Good codes can be produced by a few permutations , 1982, IEEE Trans. Inf. Theory.
[4] Imre Csiszár,et al. Graph decomposition: A new key to coding theorems , 1981, IEEE Trans. Inf. Theory.
[5] I. Csiszár,et al. On the capacity of the arbitrarily varying channel for maximum probability of error , 1981 .
[6] János Körner,et al. Universally attainable error exponents for broadcast channels with degraded message sets , 1980, IEEE Trans. Inf. Theory.
[7] Imre Csiszár,et al. Towards a general theory of source networks , 1980, IEEE Trans. Inf. Theory.
[8] Giuseppe Longo,et al. The source coding theorem revisited: A combinatorial approach , 1979, IEEE Trans. Inf. Theory.
[9] R. A. McDonald,et al. Noiseless Coding of Correlated Information Sources , 1973 .
[10] Giuseppe Longo,et al. The error exponent for the noiseless encoding of finite ergodic Markov sources , 1981, IEEE Trans. Inf. Theory.
[11] Aaron D. Wyner,et al. Recent results in the Shannon theory , 1974, IEEE Trans. Inf. Theory.
[12] Richard E. Blahut,et al. Hypothesis testing and information theory , 1974, IEEE Trans. Inf. Theory.