Abstract
In this article we study a channel with arbitrarily varying channel probability functions in the presence of a noiseless feedback channel (a.v.ch.f.). We determine its capacity by proving a coding theorem and its strong converse. Our proof of the coding theorem is constructive; we give explicitly a coding scheme which performs at any rate below the capacity with an arbitrarily small decoding error probability. The proof makes use of a new method ([1]) to prove the coding theorem for discrete memoryless channels with noiseless feedback (d.m.c.f.). It was emphasized in [1] that the method is not based on random coding or maximal coding ideas, and it is this fact that makes it particularly suited for proving coding theorems for certain systems of channels with noiseless feedback.
As a consequence of our results we obtain a formula for the zero-error capacity of a d.m.c.f., which was conjectured by Shannon ([8], p. 19).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahlswede, R.: A constructive proof of the coding theorem for discrete memoryless channels with noiseless feedback. (To appear in the Transaction of the Sixth Prague Conf. on Information Theory, Statistical Decision Functions and Random Processes.)
Ahlswede, R.: A note on the existence of the weak capacity for channels with arbitrarily varying channel probability functions and its relation to Shannon's zero-error capacity. Ann. Math. Statistics, 41, 3, 1027–1033 (1970).
Ahlswede, R.: The capacity of a channel with arbitrarily varying Gaussian channel probability functions. (To appear in the Transactions of the Sixth Prague Conference on Inf. Th., Stat. Dec. Fct's and Rand. Proc.)
Ahlswede, R., Wolfowitz, J.: The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet. Z.f.Wahrscheinlichkeitstheorie verw. Geb. 15, 186–194 (1970).
Ahlswede, R., Wolfowitz, J.: Correlated decoding for channel with arbitrarily varying channel probability functions. Inform. and Control 14, 451–473 (1969).
Kempermann, J.H.B.: Strong converses for a general memoryless channel with feedback. (To appear in the Trans. of the Sixth Prague Conf. on Inf. Th., Stat. Dec. Fct's and Rand Proc.)
Kiefer, J., Wolfowitz, J.: Channels with arbitrarily varying channel probability functions. Inform. and Control 5, 44–54 (1962).
Shannon, C.E.: The zero-error capacity of a noisy channel. IRE Trans. Inform. Theory, IT-2, 8–19 (1956).
Wolfowitz, J.: Coding Theorems of Information Theory. Heidelberg: Springer, Second ed., 1964.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ahlswede, R. Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback. Z. Wahrscheinlichkeitstheorie verw Gebiete 25, 239–252 (1973). https://doi.org/10.1007/BF00535895
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00535895