Ergodic theory, entropy, and coding problems of information theory

Štefan Šujan

Kybernetika (1983)

  • Volume: 19, Issue: Suppl, page (1)-66
  • ISSN: 0023-5954

How to cite

top

Šujan, Štefan. "Ergodic theory, entropy, and coding problems of information theory." Kybernetika 19.Suppl (1983): (1)-66. <http://eudml.org/doc/27708>.

@article{Šujan1983,
author = {Šujan, Štefan},
journal = {Kybernetika},
keywords = {coding; survey; entropy; ergodic theory of measure theoretic dynamical systems},
language = {eng},
number = {Suppl},
pages = {(1)-66},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Ergodic theory, entropy, and coding problems of information theory},
url = {http://eudml.org/doc/27708},
volume = {19},
year = {1983},
}

TY - JOUR
AU - Šujan, Štefan
TI - Ergodic theory, entropy, and coding problems of information theory
JO - Kybernetika
PY - 1983
PB - Institute of Information Theory and Automation AS CR
VL - 19
IS - Suppl
SP - (1)
EP - 66
LA - eng
KW - coding; survey; entropy; ergodic theory of measure theoretic dynamical systems
UR - http://eudml.org/doc/27708
ER -

References

top
  1. M. A. Ackoglu A. del Junco, and M. Rahe, Finitary codes between Markov processes, Z. Wahrsch. verw. Gebiete 47 (1979), 305-314. (1979) MR0525312
  2. R. L. Adler W. Goodwyn, and B. Weiss, Equivalence of topological Markov shifts, Israel J. Math. 27 (1977), 49-63. (1977) MR0437715
  3. R. L. Adler A. G. Konheim, and M. H. McAndrew, Topological entropy, Trans. Amer. Math. Soc. 114 (1965), 309-319. (1965) MR0175106
  4. R. L. Adler, B. Marcus, Topological entropy and equivalence of dynamical systems, Memoirs Amer. Math. Soc. 219 (1979). (1979) Zbl0412.54050MR0533691
  5. R. L. Adler, B. Weiss, Similarity of the automorphisms of the torus, Memoirs Amer. Math. Soc. 98 (1970). (1970) MR0257315
  6. V. M. Alekseev, Symbolic Dynamics, (in Russian). Math. Institute, AN USSR, Kiev 1976. (1976) MR0464317
  7. V. M. Alekseev, M. V. Jakobson, Symbolic dynamics and hyperbolic dynamical systems, (in Russian). Supplement to R. Bowen: Methods of Symbolic Dynamics (in Russian). Mir, Moskva 1979, pp. 196-240. (1979) 
  8. R. B. Ash, Information Theory, J. Wiley, New York 1965. (1965) Zbl0141.34904MR0229475
  9. T. Berger, Rate Distortion Theory, Prentice Hall, Englewood Cliff's 1971. (1971) MR0408988
  10. T. Berger, Information singular processes, IEEE Trans. Inform. Theory IT-20 (1975), 502-511.. (1975) MR0398667
  11. P. Billingsley, Ergodic Theory and Information, J. Wiley, New York-London-Sydney 1965. (1965) Zbl0141.16702MR0192027
  12. P. Billingsley, Convergence of Probability Measures, J. Wiley, New York-London-Sydney-Toronto 1968. (1968) Zbl0172.21201MR0233396
  13. R. E. Blahut, Computation of channel capacity and rate-distortion functions, IEEE Trans. Inform. Theory IT-18 (1972), 460-473. (1972) Zbl0247.94017MR0476161
  14. H. Blasbalg, R. van Blerkom, Message compression, IRE Trans. Space Electron. Telemech. 1962, 228-338. (1962) 
  15. J. R. Blum, D. L. Hanson, On invariant probability measures I, Pacific J. Math. 10 (1960), 1125-1240. (1960) 
  16. J. R. Blum, D. L. Hanson, On the isomorphism problem for Bernoulli schemes, Bull. Amer. Math. Soc. 63 (1963), 221-223. (1963) Zbl0121.13601MR0143862
  17. R. Bowen, Symbolic dynamics for hyperbolic systems, Amer. J. Math. 95 (1973), 429-459. (1973) Zbl0257.54042MR0339281
  18. R. Bowen, Topological entropy for non-compact sets, Trans. Amer. Math. Soc. 184 (1973), 413-423. (1973) MR0338317
  19. R. Bowen, Smooth partitions of Anosov diffeomorphisms are weak Bernoulli, Israel J. Math. 27(1975), 95-100. (1975) Zbl0315.58020MR0385927
  20. R. Bowen, Equilibrium States and the Ergodic Theory of Anosov Diffeomorphisms, (Lecture Notes in Mathematics 470.) Springer-Verlag, Berlin-Heidelberg-New York 1975. (1975) Zbl0308.28010MR2423393
  21. R. Bowen, D. Ruelle, The ergodic theory of Axiom A flows, Invent. Mathematicae 29 (1975), 181-202. (1975) Zbl0311.58010MR0380889
  22. R. C. Bradley, Jr., On the strong mixing and weak Bernoulli conditions, Z. Wahrsch. verw. Gebiete 51 (1980), 49-54. (1980) Zbl0396.60038MR0566107
  23. A. A. Brudno, Entropy and algorithmic complexity of trajectories of a dynamical system, (in Russian). Preprint, VNIISI, Moskva 1980. (1980) 
  24. E. Coven, M. Paul, Endomorphisms of irreducible shifts of finite type, Math. Systems Theory 8(1974), 165-175. (1974) MR0383378
  25. L. D. Davisson, Universal noiseless coding, IEEE Trans. Inform. Theory IT-19 (1973), 783-795. (1973) Zbl0283.94005MR0465519
  26. L. D. Davisson, R. M. Gray, A simplified proof of the sliding-block source coding theorem and its universal extension, Proc. Int. Conf. on Communication, Vol. 2, pp. 34.4.1 - 34.4.5. Toronto, Canada 1978. (1978) MR0583948
  27. A. del Junco, M. Rahe, Finitary codings and weak Bernoulli partitions, Proc. Amer. Math. Soc. 75 (1979), 259-364. (1979) Zbl0417.28011MR0532147
  28. M. Denker, Finite generators for ergodic measure-preserving transformations, Z. Wahrsch. verw. Gebiete 29 (1974), 45-55. (1974) MR0382587
  29. M. Denker, Generators and almost topological isomorphisms, Astérisque 59 (1977), 23-35. (1977) MR0499073
  30. M. Denker C. Grillenberger, and K. Sigmund, Ergodic Theory on Compact Spaces, (Lecture Notes in Mathematics 527.) Springer-Verlag, Berlin-Heidelberg-New York 1976. (1976) MR0457675
  31. M. Denker, M. Keane, Almost topological dynamical systems, Israel J. Math. 34 (1979), 139-160. (1979) Zbl0441.28008MR0571401
  32. M. Denker, M. Keane, Finitary codes and the law of the iterated logarithm, Z. Wahrsch. verw. Gebiete 52 (1980), 321-331. (1980) Zbl0417.60040MR0576892
  33. J. G. Dunham, Abstract alphabet sliding-block entropy compression coding with a fidelity criterion, Ann. Probab. 8 (1980), 1085-1092. (1980) Zbl0452.94009MR0602382
  34. R. Fellgett, W. Parry, Endomorphisms of a Lebesgue space II, Israel J. Math. 21 (1975), 167-172. (1975) Zbl0305.28009MR0382591
  35. B. M. Fitingoff, Optimal coding in case of unknown and changing message statistics, (in Russian). Problemy Peredachi Informacii 2 (1966), 3-11. (1966) MR0202498
  36. B. M. Fitingoff, The compression of discrete information, (in Russian). Problemy Peredachi Informacii 3 (1967), 28-36. (1967) MR0290859
  37. R. J. Fontana R. M. Gray, and J. C. Kieffer, Asymptotically mean stationary channels, IEEE Trans. Inform. Theory IT-27 (1981), 308-316. (1981) MR0619116
  38. N. Friedman, D. S. Ornstein, On the isomorphism of weak Bernoulli transformations, Adv. in Math. 5 (1970), 365-394. (1970) MR0274718
  39. R. G. Gallager, Information Theory and Reliable Communication, J. Wiley, New York 1968. (1968) Zbl0198.52201
  40. F. R. Gantmacher, The Theory of Matrices, Vols. I and II. Chelsea, New York 1959. (1959) Zbl0085.01001
  41. R. M. Gray, Sliding-block source coding, IEEE Trans. Inform. Theory IT-21 (1975), 357-368. (1975) Zbl0308.94015MR0376230
  42. R. M. Gray, L. D. Davisson, The ergodic decomposition of stationary discrete random processes, IEEE Trans. Inform. Theory IT-20 (1974), 625 - 636. (1974) Zbl0301.94027MR0373763
  43. R. M. Gray, L. D. Davisson, Source coding theorems without the ergodic assumption, IEEE Trans. Inform. Theory IT-20 (1974), 502-516. (1974) Zbl0301.94026MR0476163
  44. R. M. Gray, J. C. Kieffer, Mutual information rate, distortion, and quantization in metric spaces, IEEE Trans. Inform. Theory IT-26 (1980), 412-422. (1980) Zbl0452.94010MR0581788
  45. R. M. Gray, J. C. Kieffer, Asymptotically mean stationary measures, Ann. Probab. (1980), 962-973. (1980) Zbl0447.28014MR0586779
  46. R. M. Gray D. L. Neuhoff, and J. K. Omura, Process definitions of distortion-rate function and source coding theorems, IEEE Trans. Inform. Theory IT-21 (1975), 524-532. (1975) MR0449878
  47. R. M. Gray D. L. Neuhoff, and D. S. Ornstein, Non block source coding with a fidelity criterion, Ann. Probab. 3 (1975), 478-491. (1975) MR0376239
  48. R. M. Gray D. L. Neuhoff, and P. C. Shields, A generalization of Ornstein's d-distance with applications to information theory, Ann. Probab. 3 (1975), 315 - 328. (1975) MR0368127
  49. R. M. Gray, D. S. Ornstein, Sliding-block joint source/noisy channel coding theorems, IEEE Trans. Inform. Theory IT-22 (1976), 683-690. (1976) Zbl0348.94019MR0530088
  50. R. M. Gray, D. S. Ornstein, Block coding for discrete stationary d-continuous noisy channels, IEEE Trans. Inform. Theory IT-25 (1979), 292-306. (1979) MR0528007
  51. R. M. Gray D. S. Ornstein, and R. L. Dobrushin, Block synchronization, sliding-block coding, invulnerable sources, and zero-error codes for discrete noisy channels, Ann. Probab. 8 (1980), 639-674. (1980) MR0577308
  52. C. Grillenberger, U. Krengel, On marginaldistributionsandisomorphisms of stationary processes, Math. Z. 149, (1976), 131-154. (1976) MR0407237
  53. B. Hajek, Information-singularity and recoverability of random processes, IEEE Trans. Inform. Theory IT-28 (1983), 422-429. (1983) MR0672878
  54. P. R. Halmos, Measure Theory, D. Van Nostrand, Princeton N. J. 1950. (1950) Zbl0040.16802MR0033869
  55. P. R. Halmos, Lectures on Ergodic Theory, Chelsea, New York 1953. (1953) 
  56. G. Hansel, J. P. Raoult, Ergodicité, uniformité et unique ergodicité, Indiana Univ. Math. J. 23 (1973), 221-237. (1973) MR0318449
  57. R. Heim, On the algorithmic foundations of information theory, IEEETrans. Inform. Theory 1T-25 (1979), 557-566. (1979) MR0545011
  58. R. I. Jewett, The prevalence of uniquely ergodic systems, J. Math. and Mech. 19 (1970), 717-729. (1970) Zbl0192.40601MR0252604
  59. M. Keane, Coding problems in ergodic theory, Proc. Int. Conf. on Math. Physics. Camerino, Italy, 1974. (1974) 
  60. M. Keane, M. Smorodinsky, A class of finitary codes, Israel J. Math. 26 (1977), 352-371. (1977) Zbl0357.94012MR0450514
  61. M. Keane, M. Smorodinsky, Bernoulli schemes of the same entropy are finitarily isomorphic, Ann. Math. 109 (1979). 397-406. (1979) Zbl0405.28017MR0528969
  62. M. Keane, M. Smorodinsky, The finitary isomorphism theorem for Markov shifts, Bull. (New Series) Amer. Math. Soc. 1 (1979), 436-438. (1979) Zbl0407.28010MR0520082
  63. A. I. Khinchine, Mathematical Foundations of Information Theory, Dover, New York 1957. (1957) MR0092709
  64. J. C. Kieffer, On approximation of stationary measures by periodic and ergodic measures, Ann. Probab. 2 (1974), 530-534. (1974) MR0369661
  65. J. C. Kieffer, A generalized Shannon-McMillan theorem for the action of an amenable group on a probability space, Ann. Probab. 3 (1975), 1031 - 1037. (1975) MR0393422
  66. J. C. Kieffer, Block coding for an ergodic source relative to a zero-one valued fidelity criterion, IEEE Trans. Inform. Theory IT-24 (1978), 432-438. (1978) Zbl0385.94011MR0504358
  67. J. C. Kieffer, A unified approach to weak universal source coding, IEEE Trans. Inform. Theory IT-24 (1978), 674-682. (1978) Zbl0394.94012MR0514346
  68. J. C. Kieffer, On the minimum rate for strong universal block coding of a class of ergodic sources, IEEE Trans. Inform. Theory IT-26 (1980), 693-702. (1980) Zbl0473.94007MR0596278
  69. J. C. Kieffer, On the transmission of Bernoulli sources over stationary channels, Ann. Probab. 8 (1980), 942-961. (1980) Zbl0452.94012MR0586778
  70. J. C. Kieffer, On coding a stationary process to achieve a given marginal distribution, Ann. Probab. 8 (1980), 131-141. (1980) MR0556419
  71. J. C. Kieffer, Extensions of source codirig theorems for block codes to sliding-block codes, IEEE Trans. Inform. Theory IT-26 (1970), 679-692. (1970) MR0596277
  72. J. C. Kieffer, Stationary coding over stationary channels, Z. Wahrsch. verw. Gebiete 56 (1981), 113-136. (1981) Zbl0444.94007MR0612163
  73. J. C. Kieffer, Block coding for weakly continuous channels, IEEE Trans. Inform. Theory IT-27 (1981), 721-727. (1981) Zbl0473.94004MR0650708
  74. J. C. Kieffer, Perfect transmission over a discrete memoryless channel requires infinite expected coding time, J. Combin. Inform. System Sci. 5 (1980), 317-322. (1980) Zbl0475.94007MR0609819
  75. J. C. Kieffer, Sliding-Ыock coding for weakly continuous channels, IEEE Trans. Inform. Theory IT-28 (1982), 2-10. (1982) MR0651095
  76. J. C. Kieffer, Characterizations of d-total boundedness for classes of B sources, IEEE Trans. Inform. Theory IT-28 (1982), 26-35. (1982) Zbl0473.94009MR0651098
  77. J. C. Kieffer, On obtaining a stationary process isomorphic to a given process with a desired distribution, Preprint, Univ. of Missouri at Rolla, 1982. (1982) MR0725630
  78. J. C. Kieffer, Generators with prescribed marginals for nonergodic automorphisms, Lecture presented at the 9th Prague Conf. Inform. Theory, Prague, June 1982. (1982) MR0757901
  79. J. C. Kieffer, M. Rahe, Selecting universal partitions in ergodic theory, Ann. Probab. 9 (1981), 705-709. (1981) Zbl0464.60036MR0624699
  80. A. N. Kolmogorov, A new metric invariant of transitive dynamical systems and automorphisms of Lebesgue spaces, (in Russian). Doklady AN SSSR 119 (1958), 862-864. (1958) MR0103254
  81. A. N. Kolmogorov, The three approaches to the definition of the concept "amount of information", (in Russian). Problemy Peredachi Informacii 5 (1965), 3 - 7. (1965) MR0184801
  82. I. P. Kornfeľd, Ya. G. Sinai, and S. V. Fomin, Ergodic Theory, (in Russian). Nauka, Moskva 1980. (1980) MR0610981
  83. U. Krengel, Recent results on generators in ergodic theory, Trans. бth Conf. Inform. Theory etc, Academia, Prague 1973, 465 - 482. (1973) Zbl0318.94024MR0348078
  84. U. Krengel, Discussion of Professor's Ornstein's paper, (see [45]). Ann. Probab. 1 (1973). (1973) 
  85. W. Krieger, On entropy and generators of measure-preserving transformations, Trans. Amer. Math. Soc. 119 (1970), 453-464. Erratum: ibid. 168 (1972), 519. (1970) Zbl0204.07904MR0259068
  86. W. Krieger, On unique ergodicity, Proc. бth Berkeley Symp. Math. Stat. Prob., Vol. I. University of California Press, Los Angeles 1972, 327-346. (1972) Zbl0262.28013MR0393402
  87. N. Kryloff, N. Bogoliouboff, La théorie générale de la mesure dans son application à ľétude des systémes dynamiques de la mécanique non linéaire, Ann. Math. 38 (1937), 65-113. (1937) MR1503326
  88. A. G. Kushnirenko, On metric invariants of entropy type, (in Russian). Uspehi Mat. Nauk 22 (1967), 57-65. (1967) Zbl0169.46101MR0217257
  89. A. Leon-Garcia L. D. Davisson, and D. L. Neuhoff, New results on coding of stationary nonergodic sources, IEEE Trans. Inform. Theory IT-25 (1979), 137-144. (1979) MR0521306
  90. K. M. Mackenthun, M. B. Pursley, Variable-rate universal block source coding subject to a fidelity criterion, IEEE Trans. Inform. Theory IT-24 (1978), 349 - 360. (1978) MR0493647
  91. B. Marcus, Factors and extensions of full shifts, Monatsh. Math. 88 (1979), 239-247. (1979) Zbl0432.54036MR0553733
  92. B. McMillan, The basic theorems of information theory, Ann. Math. Statist. 24 (1953), 196-219. (1953) Zbl0050.35501MR0055621
  93. L. D. Meshalkin, One particular case of isomorphism of Bernoulli schemes, (in Russian). Doklady AN SSR 141 (1959), 41-44. (1959) 
  94. M. Morse, Symbolic Dynamics, (lecture notes). Institute for Advanced Study, Princeton 1966. (1966) Zbl0164.22201
  95. D. L. Neuhoff R. M. Gray.and L. D. Davisson, Fixed-rate universal block source coding with a fidelity criterion, IEEE Trans. Inform. Theory IT-22 (1975), 524-532. (1975) MR0411825
  96. D. L. Neuhoff, P. C. Shields, Fixed-rate universal codes for Markov sources, IEEE Trans. Inform. Theory IT-24 (1978), 360-367. (1978) Zbl0404.94006MR0490453
  97. D. L. Neuhoff, P. C. Shields, Channels with almost finite memory, IEEE Trans. Inform. Theory 1T-25 (1979), 440-447. (1979) Zbl0409.94011MR0536234
  98. D. L. Neuhoff, P. C. Shields, Indecomposable finite state channels and primitive approximation, IEEE Trans. Inform. Theory IT-28 (1982), 11-18. (1982) Zbl0483.94011MR0651096
  99. D. S. Ornstein, Bernoulli shifts with the same entropy are isomorphic, Adv. in Math. 4 (1970), 338-352. (1970) Zbl0197.33502MR0257322
  100. D. S. Ornstein, Factors of Bernoulli shifts are Bernoulli, Adv. in Math. 5 (1970), 349-364. (1970) MR0274717
  101. D. S. Ornstein, Imbedding Bernoulli shifts in flows, Contributions to Ergodic Theory and Probability. (Lecture Notes in Mathematics 160.) Springer-Verlag, Berlin-Heidelberg-New York 1970, 178-218. (1970) Zbl0227.28013MR0272985
  102. D. S. Ornstein, An application of ergodic theory to probability theory, Ann. Probab. 1 (1973), 43-65. (1973) Zbl0282.28009MR0348831
  103. D. S. Ornstein, Ergodic Theory, Randomness, and Dynamical Systems, Yale Univ. Press, New Haven-London 1974. (1974) Zbl0296.28016MR0447525
  104. D. S. Ornstein, B. Weiss, Ergodic theory of amenable group actions. I: The Rohlin lemma, Bull. (New Series) Amer. Math. Soc. 2 (1980), 161-164. (1980) Zbl0427.28018MR0551753
  105. J. C. Oxtoby, Ergodic sets, Bull. Amer. Math. Soc. 58 (1952), 116-136. (1952) Zbl0046.11504MR0047262
  106. W. Parry, Intrinsic Markov chains, Trans. Amer. Math. Soc. 112 (1964), 55 - 66. (1964) Zbl0127.35301MR0161372
  107. W. Parry, Entropy and Generators in Ergodic Theory, W. A. Benjamin, New York-Amsterdam 1969. (1969) Zbl0175.34001MR0262464
  108. W. Parry, A finitary classification of topological Markov chains and sofic systems, Bull. London Math. Soc. 9 (1977), 86-92. (1977) Zbl0352.60054MR0482707
  109. W. Parry, Endomorphisms of a Lebesgue space III, Israel J. Math. 21 (1975), 167-172. (1975) Zbl0312.28018MR0382591
  110. W. Parry, The information cocycle and ϵ -bounded codes, Israel J. Math. 29 (1978), 205-230. (1978) MR0480943
  111. W. Parry, An information obstruction to finite expected coding length, Ergodic Theory. Proceedings, Oberwolfach. (Lecture Notes in Mathematics 729.) Springer-Verlag, Berlin-Heidelberg-New York 1979, 163-168. (1979) Zbl0414.28016MR0550419
  112. W. Parry, Finitary isomorphisms with finite expected code-length, Bull. London Math. Soc. 11 (1979), 170- 176. (1979) MR0541971
  113. W. Parry, Topics in Ergodic Theory, (Cambridge Tracts in Mathematics 75.) Cambridge Univ. Press, Cambridge 1981. (1981) Zbl0449.28016MR0614142
  114. W. Parry, K. Schmidt, A note on cocycles of unitary representations, Proc. Amer. Math. Soc. 55 (1976), 185-190. (1976) Zbl0329.22008MR0393336
  115. W. Parry, S. Tuncel, On the classification of Markov chains by finite equivalence, Preprint. Warwick Univ., Math. Institute, March 1981. (1981) Zbl0485.60063MR0662472
  116. K. R. Parthasarathy, Probability Measures on Metric Spaces, Academic Press, New York 1967. (1967) Zbl0153.19101MR0226684
  117. M. B. Pursley, L. D. Davisson, Variable-rate coding for nonergodic sources and classes of sources subject to a fìdelity constraint, IEEE Trans. Inform. Theory IT-22 (1976), 324-337. (1976) MR0408991
  118. M. B. Pursley, K. M. Mackenthun, Variable-rate coding for classes of sources with generalized alphabets, IEEE Trans. Inform. Theory IT-23 (1977), 592-597. (1977) Zbl0364.94026MR0469520
  119. V. A. Rohlin, On basic concepts of measure theory, (in Russian). Mat. Sbornik 67 (1949), 107-150. (1949) MR0030584
  120. V.A. Rohlin, Selected problems of the metric theory of dynamical systems, (in Russian). Uspehi Mat. Nauk 30 (1949), 57-128. (1949) MR0030710
  121. V. A. Rohlin, On the decomposition of a dynamical system into transitive components, (in Russian). Mat. Sbornik 67 (1949), 235-249. (1949) MR0032958
  122. V. A. Rohlin, Ya. G. Sinai, Construction and properties of invariant measurable partitions, (in Russian). Doklady AN SSSR 141 (1961), 1038 - 1041. (1961) MR0152629
  123. D. J. Rudolph, A characterization of those processes finitarily isomorphic to a Bernoulli shift, Ergodic Theory and Dynamical Systems I. Progress in Mathematics, Vol. 10. Birkhäuser, Boston, Mass. 1981, 1 - 64. (1981) Zbl0483.28015MR0633760
  124. D. J. Sakrison, The rate distortion function of a class of sources, Inform. and Control 15 (1969), 165-195. (1969) MR0262005
  125. C. E. Shannon, A mathematical theory of communication, Bell. System Techn. J. 27 (1948), 379-432, 623-656. (1948) Zbl1154.94303MR0026286
  126. C. E. Shannon, Coding theorems for discrete source with a fidelity criterion, IRE Nat. Conv. Rec, part 4 (1959), 142-163. (1959) 
  127. C. E. Shannon, The zero-error capacity of a noisy channel, IRE Trans. 3 (1056), 8 - 32. MR0089131
  128. P. C. Shields, The Theory of Bernoulli Shifts, Univ. of Chicago Press, Chicago 1973. (1973) Zbl0308.28011MR0442198
  129. P. C. Shields, Stationary coding of processes, IEEE Trans. Inform. Theory IT-25 (1979), 283-291. (1979) Zbl0401.94018MR0528006
  130. P. C. Shields, Almost block independence, Z. Wahrsch. verw. Gebiete 49 (1979), 119-123. (1979) Zbl0393.60031MR0539668
  131. P. C. Shields, D. L. Neuhoff, Block and sliding-block source coding, IEEE Trans. Inform. Theory 1T-23 (1977), 211-215. (1977) Zbl0383.94018MR0446738
  132. K. Sigmund, On the prevalence of zero entropy, Israel J. Math. 10 (1971), 281-288. (1971) Zbl0225.28012MR0297970
  133. Ya. G. Sinai, On the notion of entropy of a dynamical system, (in Russian). Doklady AN SSSR 124 (1959), 768-771. (1959) MR0103256
  134. Ya. G. Sinai, On weak isomorphism of transformations with an invariant measure, (in Russian). Mat. Sbornik 63 (1964), 23-42. (1964) MR0161961
  135. S. Smale, Differentiable dynamical systems, Bull. Amer. Math. Soc. 73 (1967), 747-817. (1967) Zbl0202.55202MR0228014
  136. M. Smorodinsky, Ergodic Theory, Entropy, (Lecture Notes in Mathematics 214.) Springer-Verlag, Berlin- Heidelberg- New York 1971. (1971) Zbl0213.07502MR0422582
  137. M. Smorodinsky, A partition on a Bernoulli shift which is not weak Bernoulli, Math. Systems Theory 5 (1971), 201-203. (1971) MR0297971
  138. Š. Šujan, Generators of an abelian group of invertible measure-preserving transformations, Monatsh. Math. 90 (1980), 68-79. (1980) MR0593832
  139. Š. Šujan, Epsilon-rates, epsilon-quantiles, and group coding theorems for firiitely additîve information sources, Kybernetika 16 (1980), 105-119. (1980) MR0575419
  140. Š. Šujan, Existence of asymptotic rate for asymptotically mean stationary sources with countable alphabets, Trans. Зrd Czechosl.-Soviet-Hung. Seminar on Information Theory. ÚTIA ČSAV, Prague 1980, 201-207. (1980) 
  141. Š. Šujan, Channels with additive asymptotically mean stationary noise, Kybernetika 17 (1981), 1-15. (1981) MR0629345
  142. Š. Šujan, On the capacity of asymptotically mean stationary channels, Kybernetika 17 (1981), 122-233. (1981) MR0628210
  143. Š. Šujan, Continuity and quantization of channels with infinite alphabets, Kybernetika 17 (1981), 465-478. (1981) MR0674062
  144. Š. Šujan, Block transmissibility and quantization. Probability and Statistical Inference, (W. Grossmann et al., eds.), D. Reidel, Dordrecht-Boston-London 1982, 361 - 371. (1982) MR0668232
  145. Š. Šujan, A local structure of stationary perfectly noiseless codes between stationary nonergodic sources. I: General considerations, Kybernetika 18 (1982), 361-376. (1982) MR0686518
  146. Š. Šujan, A local structure of stationary perfectly noiseless codes between stationary nonergodic sources. II: Applications, Kybernetika 18 (1982), 465-484. (1982) MR0707396
  147. Š. Šujan, Codes in ergodic theory and information: Some examples, Proc. Conf. Ergodic Theory and Related Topics, Akademie-Verlag, Berlin 1982 (to appear). (1982) 
  148. Š. Šujan, Finite generators for amenable group actions, (submitted). 
  149. J.-P. Thouvenot, Quelques proprietes des systémes dynamiques qui se decomposent en un produit de deux systémes dont l'un est un schema de Bernoulli, Israel J. Math. 21 (1975), 178-207. (1975) Zbl0329.28008MR0399419
  150. S. Tuncel, Conditional pressure and coding, Israel J. Math. 39 (1981), 101 - 112. (1981) Zbl0472.28016MR0617293
  151. P. Walters, Ergodic Theory. Introductory Lectures, (Lectures Notes in Mathematics 458.) Springer-Verlag, Berlin -Heidelberg-New York 1975. (1975) Zbl0299.28012MR0480949
  152. B. Weiss, The isomorphism problem in ergodic theory, Bull. Amer. Math. Soc. 78 (1972), 668-684. (1972) Zbl0255.28014MR0304616
  153. K. Winkelbauer, On discrete information sources, Trans. 3rd Prague Conf. Inform. Theory etc., NČSAV, Prague 1964, 765-830. (1964) Zbl0126.35702MR0166000
  154. K. Winkelbauer, On the asymptotic rate of nonergodic information sources, Kybernetika 6 (1970), 128-148. (1970) MR0275979
  155. K. Winkelbauer, On the existence of finite generators for invertible measure-preserving transformations, Comment. Math. Univ. Carolinae 18 (1977), 789 - 812. (1977) Zbl0368.28020MR0463403
  156. J. Wolfowitz, Coding Theorems of Information Theory, 2nd ed. Springer-Verlag, New York 1964. (1964) Zbl0132.39704MR0176851
  157. G. M. Zaslavskij, On the isomorphism problem for stationary processes, (in Russian). Teoria veroyatnostej i primen. 9 (1964), 241 - 298. (1964) Zbl0154.18901MR0164377
  158. J. Ziv, Coding of sources with unknown statistics. Part I: Probability of encoding error; Part II: Distortion relative to a fidelity criterion, IEEE Trans. Inform. Theory IT-18 (1972), 384-394. (1972) MR0379017
  159. J. Ziv, Coding theorems for individual sequences, IEEE Trans. Inform. Theory IT-24 (1978), 405-413. (1978) Zbl0416.94006MR0504371
  160. J. Ziv, A. Lempel, Compression of individual sequences via variable-rate coding, IEEE Trans. Inform. Theory IT-24 (1978), 530-536. (1978) Zbl0392.94004MR0507465

Citations in EuDML Documents

top
  1. Štefan Šujan, Some stationary source and joint source-channel coding theorems with a fidelity criterion
  2. Igor Vajda, Alphabet-oriented and user-oriented source coding theories
  3. Štefan Šujan, Some functionals on sets of stationary codes
  4. Štefan Šujan, A local structure of stationary perfectly noiseless codes between stationary non-ergodic sources. III. Relative isomorphism of non-ergodic transformations
  5. J. S. Chawla, Isomorphism of measure preserving transformations

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.