By Topic

On interactive communication

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
$33 $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

3 Author(s)
R. Ahlswede ; Fakultat fur Math., Bielefeld Univ., Germany ; N. Cai ; Z. Zhang

Ahlswede has previously introduced an abstract correlated source (𝒱×𝒲,S) with outputs (υ, ω)∈S⊂𝒱×𝒲, where persons P𝒱 and P𝒲 observe υ and ω, respectively. More recently, Orlitsky considered the minimal number C m of bits to be transmitted in m rounds to “inform P 𝒲 about υ over one channel.” He showed that C 2⩽4C+3 and that in general C2NOT~C. We give a simple example for C3NOT~C. However, for the new model “inform P𝒲 over two channels”, four rounds are optimal for this example-a result we conjecture in general. If both P𝒱 and P𝒲 are to be informed over two channels about the other outcome, we determine asymptotically the complexities for all sources. In our last model “inform P𝒱 and P𝒲 over one channel” for all sources the total number T2 of required bits is known asymptotically and T is bounded from below in terms of average degrees. There are exact results for several classes of regular sources. An attempt is made to discuss the methods of the subject systematically

Published in:

IEEE Transactions on Information Theory  (Volume:43 ,  Issue: 1 )