Advertisement

Multiple Descriptions

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

Abstract

The following problem of jointly good descriptions was posed by Gersho, Witsenhausen, Wolf, Wyner, Ziv, and Ozarow at the September 1979 IEEE Information Theory Workshop. Contributions to this problem can be found in Witsenhausen [1], Wolf, Wyner, and Ziv [2], Ozarow [3], and Witsenhausen and Wyner [4]. Suppose we wish to send a description of a stochastic process to a destination through a communication network. Assume that there is a chance that the description will be lost. Therefore we send two descriptions and hope that one of them will get through. Each description should be individually good. However, if both get through, then we wish to combined descriptive information to be as large as possible.

References

  1. 1.
    H.S. Witsenhausen, On source networks with minimal breakdown degradation. Bell. Syst. Tech. J. 59(6), 1083–1087 (1980)CrossRefGoogle Scholar
  2. 2.
    J.K. Wolf, A.D. Wyner, J. Ziv, Source coding for multiple descriptions. Bell. Syst. Tech. J. 59(8), 1417–1426 (1980)MathSciNetCrossRefGoogle Scholar
  3. 3.
    L. Ozarow, On a source coding problem with two channels and three receivers. Bell. Syst. Tech. J. 59(10), 1909–1921 (1980)MathSciNetCrossRefGoogle Scholar
  4. 4.
    H.S. Witsenhausen, A.D. Wyner, Source coding for multiple descriptions II: A binary source. Bell. Syst. Tech. J. 60(10), 2281–2292 (1981)MathSciNetCrossRefGoogle Scholar
  5. 5.
    A.A. El Gamal, T.M. Cover, Achievable rates for multiple descriptions. IEEE Trans. Inform. Theory 28(6), 851–857 (1982)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Z. Zhang, T. Berger, New results in binary multiple description. IEEE Trans. Inform. Theory 33(4), 502–521 (1987)MathSciNetCrossRefGoogle Scholar
  7. 7.
    R. Ahlswede, On multiple descriptions and team guessing. IEEE Trans. Inform. Theory 32(4), 543–549 (1986)MathSciNetCrossRefGoogle Scholar
  8. 8.
    M.S. Pinsker, Information and Information Stability of Random Variables and Processes (Holden-Day, San Francisco, 1964)zbMATHGoogle Scholar
  9. 9.
    R. Ahlswede, An elementary proof of the strong converse theorem for the multiple-access channel. J. Comb. Inform. Syst. Sci. 7(3), 216–230 (1982)MathSciNetzbMATHGoogle Scholar
  10. 10.
    R. Ahlswede, On two-way communication channels and a problem by Zarankiewics, in Transactions 6-th Prague Conference on Information Theory, Sept. 1971, pp. 23–37 (Publishing House of the Czechoslovakian Academy of Sciences, 1974)Google Scholar
  11. 11.
    G. Dueck, The strong converse to the coding theorem for the multiple-access channel. J. Comb. Inform. Syst. Sci. 6(3), 187–196 (1981)MathSciNetzbMATHGoogle Scholar
  12. 12.
    I. Csiszár, J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems (Academic, New York, 1982)zbMATHGoogle Scholar
  13. 13.
    T. Berger, Z. Zhang, Minimum breakdown degradation in binary source coding. IEEE Trans. Inform. Theory 29(6), 807–814 (1983)MathSciNetCrossRefGoogle Scholar
  14. 14.
    H.S. Witsenhausen, On team guessing with independent information. Math. Oper. Res. 6(2), 293–304 (1981)MathSciNetCrossRefGoogle Scholar
  15. 15.
    H.S. Witsenhausen, Team guessing with lacunary information. Math. Oper. Res. 8(1), 110–121 (1983)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.BielefeldGermany

Personalised recommendations