By Topic

Multiple-Access Channel With Partial and Controlled Cribbing Encoders

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)
Asnani, H. ; Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA ; Permuter, H.H.

In this paper, we consider a multiple-access channel (MAC) with partial cribbing encoders. This means that each of the two encoders obtains a deterministic function of the output of the other encoder with or without delay. The partial cribbing scheme is especially motivated by the additive noise Gaussian MAC, where perfect cribbing results in the degenerated case of full cooperation between the encoders and requires an infinite entropy link. We derive a single-letter characterization of the capacity of the MAC with partial cribbing for the cases of causal and strictly causal cribbing. Several numerical examples, such as those of quantized cribbing, are presented. We further consider and derive the capacity region where the cribbing depends on actions that are functions of the previous cribbed observations. In particular, we consider a scenario where the action is taken to decide “to crib or not to crib” and show that a naive time-sharing strategy is not optimal.

Published in:

Information Theory, IEEE Transactions on  (Volume:59 ,  Issue: 4 )