On multiple descriptions and team guessing
Ahlswede, R.
Information Theory, IEEE Transactions on
Volume 32, Issue 4, Jul 1986 Page(s): 543 - 549
Digital Object Identifier  
Summary: 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.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.