By Topic

Information and control: matching channels

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

2 Author(s)
R. Ahlswede ; Fakultat fur Math., Bielefeld Univ., Germany ; Ning Cai

The transmission problem for noisy channels is usually studied under the condition that the decoding error probability λ is small and is sometimes studied under the condition that λ=0. Here we just require that λ<1 and obtain a problem which is equivalent to a coding problem with small λ for the “deterministic matching channel.” In this new model, a cooperative person knows the codeword to be sent and can choose (match) the state sequence of the channel. There are interesting connections to combinatorial matching theory and extensions to the theory of identification as well as to multi-way channels. In particular, there is a surprising connection to Pinsker's (1978) coding theorem for the deterministic broadcast channel

Published in:

IEEE Transactions on Information Theory  (Volume:44 ,  Issue: 2 )