Channels with additive asymptotically mean stationary noise

 Access to full text

 Full (PDF)

1. R. J. Fontana R. M. Gray J. C. Kieffer, Asymptotically mean stationary channels, (1979 - preprint). (1979) MR0619116
2. R. M. Gray J. C. Kieffer, Asymptotically mean stationary measures, (1979 -submitted to Ann. of Prob.). (1979) MR0586779
3. R. M. Gray D. S. Ornstein, Block coding for discrete stationary d-continuous noisy channels, IEEE Trans. Inform. Theory 1T-25 (1979), 292-306. (1979) MR0528007
4. K. Jacobs, Die Übertragung diskreter Informationen durch periodische und fastperiodische Kanäle, Math. Annalen 757 (1959), 125-135. (1959) Zbl0089.33903MR0128003
5. J. C. Kieffer, A general formula for the capacity of stationary nonanticipatory channels, Inform. and Control 26 (1971), 381-391. (1971) MR0384324
6. J. Nedoma, The capacity of a discrete channel, Trans. 1st Prague Conf. Inform. Theory etc., NČSAV, Prague 1957, 143-181. (1957) Zbl0088.10701MR0102451
7. K. R. Parthasarathy, On the integral representation of the rate of transmission of a stationary channel, 111. J. Math. 2 (1961), 299-305. (1961) Zbl0100.33903MR0121259
8. K. R. Parthasarathy, Effective entropy rate and transmission of information through channels with additive random noise, Sankhya A 25 (1963), 75-84. (1963) Zbl0119.34003MR0173568
9. C. E. Shannon, A mathematical theory of communication, Bell. Syst. Techn. J. 27 (1948), 379-423, 623-656. (1948) Zbl1154.94303MR0026286
10. Š. Šujan, On the integral representation of the entropy rate, Studia Sci. Math. Hung. 11 (1976), 25-36. (1976) MR0545093
11. Š. Šujan, A generalized coding problem for discrete information sources, Supplement. Kybernetika 13 (1977), 95 pp. (1977) MR0465531
12. Š. Šujan, Epsilon-rates, epsilon-quantiles, and group coding theorems for finitely additive information sources, Kybernetika 16 (1980), 105-119. (1980) MR0575419
13. Š. Šujan, Existence of asymptotic rate for asymptotically mean stationary sources with countable alphabets, 3rd Czechoslovak-Soviet-Hungarian Seminar on Inform. Theory, Liblice 1980, 201-206. (1980) 
14. K. Winkelbauer, On the asymptotic rate of non-ergodic information sources, Kybernetika 6 (1970), 127-148. (1970) Zbl0245.94013MR0275979
15. K. Winkelbauer, On the coding theorem for decomposable channels I, II, Kybernetika 7 (1971), 109-123, 230-255. (1971) MR0300751
16. K. Winkelbauer, On the regularity condition for decomposable communication channels, Kybernetika 7 (1971), 314-327. (1971) Zbl0244.94007MR0349272
17. K. Winkelbauer, On discrete channels decomposable into memoryless components, Kybernetika 5 (1972), 114-132. (1972) Zbl0256.94021MR0339887
18. K. Winkelbauer, On the capacity of decomposable channels, Trans. 6th Prague Conf. Inform. Theory etc., Academia, Prague 1973, 903-914. (1973) Zbl0298.94026MR0371509
19. K. Winkelbauer, Information channels with memoryless components, Trans. 7th Prague Conf. Inform. Theory etc., Academia, Prague 1978, 559-576. (1978) Zbl0421.94007MR0519508
20. K. Winkelbauer, Non-smooth channels with additive random noise, Trans. 8th Prague Conf. Inform. Theory etc., Academia, Prague 1978, Vol. B, 365-381. (1978) Zbl0416.94008MR0536830
21. K. Winkelbauer, Discrete communication channels decomposable into finite-memory components, In: Contributions to Statistics (Jaroslav Hájek Memorial Volume, J. Jurečková, ed.), Academia, Prague 1979, 277-306. (1979) Zbl0421.94008MR0561275
22. J. Wolfowitz, Coding Theorems of Information Theory, 2nd edition. Springer-Verlag, Berlin-Gottingen-New York 1964. (1964) Zbl0132.39704MR0176851

1. Štefan Šujan, On the capacity of asymptotically mean stationary channels
2. Štefan Šujan, Continuity and quantization of channels with infinite alphabets
3. J. S. Chawla, Isomorphism of measure preserving transformations
4. Štefan Šujan, Ergodic theory, entropy, and coding problems of information theory