By Topic

The rate loss of single letter characterization for the “dirty” multiple access channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Philosof, T. ; Dept. of EE - Syst., Tel Aviv Univ., Tel Aviv ; Zamir, R.

For general memoryless systems, the typical information theoretic solution, when exists, has a ldquosingle-letterrdquo form. This reflects the fact that optimum performance can be approached by a random code (or a random binning scheme), generated using independent and identically distributed copies of some single-letter distribution. Is that the form of the solution of any (information theoretic) problem? In fact, some counter examples are known, perhaps the most famous being the Korner-Marton ldquotwo help onerdquo problem, where the modulo-two sum of two binary sources is to be decoded from their independent encodings. In this paper we provide another counter example, the ldquodoubly-dirtyrdquo multiple access channel (MAC). Like the Korner-Marton problem, this example is associated with a multiterminal scenario where side information is distributed among several terminals; each transmitter knows part of the channel interference but the receiver is not aware of any part of it. We give an explicit solution for the capacity region of a binary version of the doubly-dirty MAC, demonstrate how this capacity region can be approached using a linear coding scheme, and prove that the ldquobest known single-letter regionrdquo is strictly contained in it. We also state a conjecture regarding a similar rate loss of single letter characterization in the Gaussian case.

Published in:

Information Theory Workshop, 2008. ITW '08. IEEE

Date of Conference:

5-9 May 2008