-
1
-
-
0000911221
-
-
1976.
-
R. Ahlswcdc. P. Gâcs, and J. Körner, "Bounds on conditional probabilities with applications in multi-user communication," Z. WahrscheinHchketistheorie u. verw. Geb., vol. 34, pp. 157-177, 1976.
-
P. Gâcs, and J. Körner, "Bounds on Conditional Probabilities with Applications in Multi-user Communication," Z. WahrscheinHchketistheorie U. Verw. Geb., Vol. 34, Pp. 157-177
-
-
Ahlswcdc, R.1
-
6
-
-
33747253256
-
-
1980.
-
R.M. Gray and J. C. Kieffer, "Asymptotically mean stationary measures,'' Annals Probab., vol. 8, pp. 962-973, Oct. 1980.
-
And J. C. Kieffer, "Asymptotically Mean Stationary Measures,'' Annals Probab., Vol. 8, Pp. 962-973, Oct.
-
-
Gray, R.M.1
-
8
-
-
0023418319
-
-
1987.
-
R.M. Gray, M. O. Dunham, and R. L. Gobbi, "Ergodicity of Markov channels," IEEE Trans. Inform. Theory, vol. IT-33, no. 5, pp. 656-664, 1987.
-
M. O. Dunham, and R. L. Gobbi, "Ergodicity of Markov Channels," IEEE Trans. Inform. Theory, Vol. IT-33, No. 5, Pp. 656-664
-
-
Gray, R.M.1
-
9
-
-
0018996523
-
-
1980.
-
D.R. Haiverson and G. L. Wise, "Discrete-time detection in φ-mixing noise," IEEE Tram-. Inform. Theory, vol. IT-26, pp. 189-198, 1980.
-
And G. L. Wise, "Discrete-time Detection in φ-Mixing Noise," IEEE Tram-. Inform. Theory, Vol. IT-26, Pp. 189-198
-
-
Haiverson, D.R.1
-
11
-
-
33747302789
-
-
1981.
-
J.C. Kieffer and M. Rahe, "Markov channels are asymptotically mean stationary," SIAM J. Math. Anal, vol. 12, no. 3, pp. 293-305, 1981.
-
And M. Rahe, "Markov Channels Are Asymptotically Mean Stationary," SIAM J. Math. Anal, Vol. 12, No. 3, Pp. 293-305
-
-
Kieffer, J.C.1
-
13
-
-
0028548396
-
-
1994.
-
T. Linder, G. Lugosi, and K. Zcgcr, "Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding," IEEE Trans. Inform. Theory, vol. 40, no. 6, pp. 1728-1740, Nov 1994.
-
G. Lugosi, and K. Zcgcr, "Rates of Convergence in the Source Coding Theorem, in Empirical Quantizer Design, and in Universal Lossy Source Coding," IEEE Trans. Inform. Theory, Vol. 40, No. 6, Pp. 1728-1740, Nov
-
-
Linder, T.1
-
14
-
-
0022720166
-
-
1986.
-
K. Marton. "A simple proof of the blowing-up lemma," IEEE Trans. Inform. Theory, vol. IT 32, no. 3, pp. 445-446, 1986.
-
"A Simple Proof of the Blowing-up Lemma," IEEE Trans. Inform. Theory, Vol. IT 32, No. 3, Pp. 445-446
-
-
Marton, K.1
-
15
-
-
84944982289
-
-
1991.
-
K. Marton and P. Shields, "Ergodic processes and zero divergence," in 1991 IEEE Int. Symp. on Information Theory (Budapest, Hungary, June 23-28, 1991).
-
And P. Shields, "Ergodic Processes and Zero Divergence," in 1991 IEEE Int. Symp. on Information Theory Budapest, Hungary, June 23-28
-
-
Marton, K.1
-
17
-
-
0029779158
-
-
1996.
-
E.-1I. Yang and J. C. Kieffer, "Simple universal lossy data compression schemes derived from Eempel-Ziv algorithm," IEEE Trans. Inform. Theory, vol. 42, no.l, pp. 239-245, Jan. 1996.
-
And J. C. Kieffer, "Simple Universal Lossy Data Compression Schemes Derived from Eempel-Ziv Algorithm," IEEE Trans. Inform. Theory, Vol. 42, No.l, Pp. 239-245, Jan.
-
-
Yang, E.-I.1
-
19
-
-
0026679656
-
-
1992.
-
J. Ziv and N. Merhav. "Estimating the number of states of a finite-state source," IEEE Trans. Inform. Theory, vol. 38, no. 1, pp. 61-65, 1992.
-
And N. Merhav. "Estimating the Number of States of A Finite-state Source," IEEE Trans. Inform. Theory, Vol. 38, No. 1, Pp. 61-65
-
-
Ziv, J.1
|