By Topic

Two results on the permuting mailbox 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

1 Author(s)
Piret, P. ; Philips Res. Lab., Brussels, Belgium

Two problems of information transmission on the permuting mailbox (or relay) channel are considered. Such a channel is characterized by the cardinality ε of the alphabet and the number b of letters in the mailbox. In the case b=1, an upper bound is obtained on the achievable rate in the jamming situation. In the case ε=2, it is proven that time-sharing is not always the best solution when both main users wish to transmit information to a third user

Published in:

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