Title :
Two results on the permuting mailbox channel
Author_Institution :
Philips Res. Lab., Brussels, Belgium
fDate :
7/1/1989 12:00:00 AM
Abstract :
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
Keywords :
information theory; telecommunication channels; alphabet; cardinality; information transmission; jamming situation; permuting mailbox channel; relay channel; time-sharing; upper bound; Convolution; Entropy; Information processing; Interference; Jamming; Notice of Violation; Relays; Taylor series; Time sharing computer systems; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
