Random Correlated Codes for the AVC and the Compound Channels

  • Rudolf AhlswedeEmail author
Part of the Foundations in Signal Processing, Communications and Networking book series (SIGNAL, volume 15)


Let \(\bigl \{W(\cdot |\cdot ,s):s\in \mathcal{S}\bigr \}\) be a family of stochastic matrices with common input and output alphabets. A compound channel (CC) (introduced by it) is defined as a family of channels \(W^n(\cdot |\cdot ,s)\), where for all \(x^n\in \mathcal {X}^n\), \(y^n\in \mathcal {Y}^n\), \(s\in \mathcal{S}\) \(W^n(y^n|x^n,s)=\prod \limits _{t=1}^nW(y_t|x_t,s)\).


  1. 1.
    K. Fan, Minimax theorems. Proc. Natl. Acad. Sci. 39, 42–47 (1958)MathSciNetCrossRefGoogle Scholar
  2. 2.
    D. Blackwell, L. Breiman, A.J. Thomasian, The capacity of a class of channels. Ann. Math. Stat. 30, 1229–1241 (1959)MathSciNetCrossRefGoogle Scholar
  3. 3.
    R. Ahlswede, Certain results in coding theory for compound channels I, in Proceedings of the Colloquium on Information Theory, Debrecen, Hungary (1967), pp. 35–60Google Scholar
  4. 4.
    R. Ahlswede, J. Wolfowitz, The structure of capacity functions for compound channels, in Proceedings of the International Symposium on Probability and Information Theory (McMaster University, Canada, 1968), pp. 12–54Google Scholar
  5. 5.
    R. Ahlswede, The weak capacity of averaged channels. Z. Wahrscheinlichkeitstheorie Verw. Gebiete 11, 61–73 (1968)Google Scholar
  6. 6.
    T.S. Han, S. Verdu, Approximation theory of output statistics. IEEE Trans. Inf. Theory IT–39, 752–772 (1993)MathSciNetCrossRefGoogle Scholar
  7. 7.
    S. Verdu, T.S. Han, A general formula for channel capacity. IEEE Trans. Inf. Theory IT–40, 1147–1157 (1994)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.BielefeldGermany

Personalised recommendations