On multiple descriptions and team guessing

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

Download
OA
Journal Article | Published | English
Abstract
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.
Publishing Year
ISSN
PUB-ID

Cite this

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.
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.
Main File(s)
Access Level
OA Open Access

This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Web of Science

View record in Web of Science®

Search this title in

Google Scholar