zbMATH — the first resource for mathematics

Zero-error stationary coding over stationary channels. (English) Zbl 0444.94007

94A24 Coding theorems (Shannon theory)
94A29 Source coding
Full Text: DOI
[1] Adler, R.L.: Ergodic and Mixing Properties of Infinite Memory Channels. Proc. Amer. Math. Soc., 12, 924-930 (1961) · Zbl 0201.53104
[2] Kieffer, J.C.: Perfect Transmission Over a Discrete Memoryless Channel Requires Infinite Expected Coding Time. [To appear in the Journal of Combinatorics, Information and System Sciences] · Zbl 0475.94007
[3] Gray, R.M., Ornstein, D.S., Dobrushin, R.L.: Block Synchronization, Sliding-Block Coding, Invulnerable Sources, and Zero Error Codes for Discrete Noisy Channels. Ann. Probab. 8, 639-674 (1980) · Zbl 0453.94010
[4] Lovasz, L.: On the Shannon Capacity of a Graph. IEEE Trans. Inform. Theory, 25, 1-7 (1979) · Zbl 0395.94021
[5] Kieffer, J.C.: On sliding block coding for transmission of a source over a stationary nonanticipatory channel. Inform. and Control, 35, 1-19 (1977) · Zbl 0365.94024
[6] Kieffer, J.C.: On the transmission of Bernoulli sources over stationary channels. Ann. Probab. 8, 942-961 (1980) · Zbl 0452.94012
[7] Kieffer, J.C.: Block Coding for a Stationary Channel Satisfying a Weak Continuity Condition. [Submitted for publication]
[8] Kieffer, J.C.: Sliding-Block Coding for Weakly Continuous Channels. [Submitted for publication] · Zbl 0473.94005
[9] Shannon, C.E.: The Zero Error Capacity of a noisy channel. Trans. Inform. Theory, 2, 8-19 (1956)
[10] Ornstein, D.S.: Bernoulli shifts with the same entropy are isomorphic. Adv. in Math., 4, 337-352 (1970) · Zbl 0197.33502
[11] Shields, P.C.: The theory of Bernoulli shifts. Chicago: Univ. of Chicago 1973 · Zbl 0308.28011
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.