## A local structure of stationary perfectly noiseless codes between stationary non-ergodic sources. II: Applications.(English)Zbl 0533.94001

This is Part II of a two-part paper and applies the results of Part I [Kybernetika 18, 361-375 (1982; Zbl 0504.94021)] to determine a complete set of invariants for the class of all conditionally Bernoulli sources, with respect to both metric and finitary isomorphisms. The results extend Ornstein and Keane-Smorodinsky isomorphism theorems. A generalization of Krieger’s finite generator theorem is proved in a form which exhibits a close connection between generator problems of ergodic theory and noiseless source coding. A finitary version of it yields an extension of an almost topological generator theorem of Denker and Keane. A result of Kieffer on zero-error transmission of ergodic sources over stationary channels is generalized to the transmission of aperiodic non-ergodic sources. A sufficient condition for $$\epsilon$$-transmissibility is derived which offers a new interpretation of $$\epsilon$$-rates.
Reviewer: G.Longo

### MSC:

 94A29 Source coding 28D20 Entropy and other invariants

Zbl 0504.94021
Full Text:

### References:

 [1] Š. Šujan: A local structure of stationary perfectly noiseless codes between stationary non-ergodic sources. Kybernetika 18 (1982), 5, 361 - 375. · Zbl 0504.94021 [2] R. L. Adler, B. Marcus: Topological entropy and equivalence of dynamical systems. Mem. Amer. Math. Soc. 219 (1979). · Zbl 0412.54050 [3] R. M. Gray: Sliding block source coding. IEEE Trans. Inform. Theory IT-2I (1975), 357-368. · Zbl 0308.94015 [4] 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. · Zbl 0453.94010 [5] M. Keane, M. Smorodinsky: The finitary isomorphism theorem for Markov shifts. Bull. Amer. Math. Soc. (New Series) 1 (1979), 346-438. · Zbl 0407.28010 [6] J. C. Kieffer: On the transmission of Bernoulli sources over stationary channels. Ann. Probab. 8 (1980), 942-961. · Zbl 0452.94012 [7] J. C. Kieffer: Block coding for a stationary channel satisfying a weak continuity condition. [8] J. C. Kieffer: Sliding-block coding for weakly continuous channels. IEEE Trans. Inform. Theory 1T-28 (1982), 2-10. · Zbl 0473.94005 [9] R. Olshen: The coincidence of measure algebras under an exchangeable probability. Z. Wahrsch. verw. Gebiete 18 (1971), 153-158. · Zbl 0206.18201 [10] R. Olshen: A note on exchangeable sequences. Z. Wahrsch. verw. Gebiete 28 (1974), 317-321. · Zbl 0265.60006 [11] D. S. Ornstein: An application of ergodic theory to probability theory. Ann. Probab. 1 (1973), 43-58. · Zbl 0282.28009 [12] S. Smale: Differentiable dynamical systems. Bull. Amer. Math. Soc. 73 (1967), 747-817. · Zbl 0202.55202 [13] Š. Šujan: A generalized coding problem for discrete information sources. Kybernetika 13 (1977), Supplement, 95 pp. [14] Š. Šujan: Epsilon-rates, epsilon-quantiles, and group coding theorems for finitely additive information sources. Kybernetika 16 (1980), 105-119. · Zbl 0441.94008 [15] Š. Šujan: Generators of an abelian group of invertible measure-preserving transformations. Monatsh. Math. 90 (1980), 67-79. · Zbl 0432.28016 [16] Š. Šujan: Epsilon-rates and noiseless fixed-rate block coding for stationary non-ergodic sources. · Zbl 0545.94009 [17] Š. Šujan: Generators for amenable group actions. · Zbl 0498.28020 [18] Š. Šujan: Codes in ergodic theory and information: some examples. · Zbl 0514.94007 [19] K. Winkelbauer: On discrete information sources. Trans. Third Prague Conf. Inform. Theory etc., NČSAV, Prague 1964, 765-830. · Zbl 0126.35702 [20] K. Winkelbauer: On the coding theorem for decomposable discrete information channels I, II. Kybernetika 7 (1971), 109-123, 230-255. · Zbl 0244.94006
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.