Advertisement

Feedback and Correlated Sources

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

Abstract

In this section, we shall see a special property of the AVC, which is that feedback increases the capacity. If noiseless feedback exists, a message is encoded to a function \(f^n=(f_1,\dots ,f_n)\) for \(f_1\in {\mathcal X}\) and \(f_t:{\mathcal Y}^{t-1}\rightarrow {\mathcal X}\), \(t=2,\dots ,n\), instead of a fixed codeword \(u\in {\mathcal X}^n\). One can define its maximal and average probabilities of error and denote the corresponding capacities by \(C_f({\mathcal W})\) and \(\overline{C}_f({\mathcal W})\) respectively, in the standard way.

References

  1. 1.
    R. Ahlswede, Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback. Z. Wahrscheinlichkeitstheorie Verw. Gebiete, vol. 25 (1973), pp. 239–252Google Scholar
  2. 2.
    R. Ahlswede, N. Cai, The AVC with noiseless feedback and maximal error probability, A capacity formula with a trichotomy, in Numbers, Information and Complexity, Special Volume in Honour of R. Ahlswede on Occasion of his 60th Birthday, ed. by I. Althöfer, N. Cai, G. Dueck, L.H. Khachatrian, M. Pinsker, A. Sárközy, I. Wegener, Z. Zhang (Kluwer Academic Publishers, Boston, 2000), pp. 151–176Google Scholar
  3. 3.
    R. Ahlswede, Combinatorial Methods and Models, Rudolf Ahlswede’s Lectures on Information Theory 4. Series: Foundations in Signal Processing, Communications and Networking, ed. by A. Ahlswede, I. Althöfer, C. Deppe, U. Tamm, vol. 13 (Springer, Berlin, 2016)Google Scholar
  4. 4.
    C.E. Shannon, The zero error capacity of a noisy channel. IRE Trans. Inform. Theory, IT 2, 8–19 (1956)MathSciNetCrossRefGoogle Scholar
  5. 5.
    R. Ahlswede, A note on the existence of the weak capacity for channels with arbitrarily varying probability functions and its relation to Shannon’s zero error capacity. Ann. Math. Stat. 41, 1027–1033 (1970)MathSciNetCrossRefGoogle Scholar
  6. 6.
    R. Ahlswede, Elimination of correlation in random codes for arbitrarily varying channels. Z. Wahrscheinlichkeitstheorie Verw. Gebiete, vol. 33 (1978), pp. 159–175Google Scholar
  7. 7.
    R. Ahlswede, N. Cai, Correlated sources help the transmission over AVC. IEEE Trans. Inf. Theory 43(4), 1254–1255 (1997)CrossRefGoogle Scholar
  8. 8.
    R. Ahlswede, I. Csiszár, Common randomness in information theory and cryptography, Part I, Secret sharing. IEEE Trans. Inform. Theory 39, 1121–1132 (1993)MathSciNetCrossRefGoogle Scholar
  9. 9.
    R. Ahlswede, I. Csiszár, Common randomness in information theory and cryptography, Part II, CR capacity. IEEE Trans. Inform. Theory 44(1), 55–62 (1998)CrossRefGoogle Scholar
  10. 10.
    R. Ahlswede, N. Cai, Arbitrarily varying multiple-access channels, Part I, Ericson’s symmetrizability is adequate, Gubner’s conjecture is true. IEEE Trans. Inf. Theory 45(2), 742–749 (1999)CrossRefGoogle Scholar
  11. 11.
    R. Ahlswede, N. Cai, Arbitrarily varying multiple-access channels, Part II, Correlated sender’s side information, correlated messages and ambiguous transmission. IEEE Trans. Inf. Theory 45(2), 749–756 (1999)CrossRefGoogle Scholar
  12. 12.
    T.M. Cover, A. ElGamal, M. Salehi, Multiple–access channel with arbitrarily correlated sources. IEEE Trans. Inform. Theory, IT 26, 648–659 (1980)MathSciNetCrossRefGoogle Scholar
  13. 13.
    R. Ahlswede, T.S. Han, On source coding with side information via a multiple–access channel and related problems in multi–user information theory. IEEE Trans. Inform. Theory, IT 29, 396–412 (1983)MathSciNetCrossRefGoogle Scholar
  14. 14.
    R. Ahlswede, Multi–way communication channels, in Proceedings of 2nd International Symposium on Information Theory, Thakadsor, Armenian 1971 (Akademiai Kiado, Budapest, 1973), pp. 23–52Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.BielefeldGermany

Personalised recommendations