On multiple descriptions and team guessing

Ahlswede R (1986)
IEEE transactions on information theory 32(4): 543-549.

Download
OA
Zeitschriftenaufsatz | Veröffentlicht | Englisch
Abstract / Bemerkung
Witsenhausen's hyperbola bound for the multiple description problem without excess rate in case of a binary source is not tight for exact joint reproductions. However, this bound is tight for almost-exact joint reproductions (Theorem1, conjectured by Witsenhausen). The proof is based on an {em approximative} form of the team guessing lemma for {em sequences} of random variables. (This result may be of interest also for team guessing). The hyperbola bound is also tight for exact joint reproductions and arbitrarily small, but positive, excess rate (Theorem2). The proof of this result uses our covering lemma.
Erscheinungsjahr
Zeitschriftentitel
IEEE transactions on information theory
Band
32
Zeitschriftennummer
4
Seite
543-549
ISSN
PUB-ID

Zitieren

Ahlswede R. On multiple descriptions and team guessing. IEEE transactions on information theory. 1986;32(4):543-549.
Ahlswede, R. (1986). On multiple descriptions and team guessing. IEEE transactions on information theory, 32(4), 543-549. doi:10.1109/TIT.1986.1057195
Ahlswede, R. (1986). On multiple descriptions and team guessing. IEEE transactions on information theory 32, 543-549.
Ahlswede, R., 1986. On multiple descriptions and team guessing. IEEE transactions on information theory, 32(4), p 543-549.
R. Ahlswede, “On multiple descriptions and team guessing”, IEEE transactions on information theory, vol. 32, 1986, pp. 543-549.
Ahlswede, R.: On multiple descriptions and team guessing. IEEE transactions on information theory. 32, 543-549 (1986).
Ahlswede, Rudolf. “On multiple descriptions and team guessing”. IEEE transactions on information theory 32.4 (1986): 543-549.
Volltext(e)
Access Level
OA Open Access
Zuletzt Hochgeladen
1970-01-01T00:00:00Z