TY - JOUR
AB - The transmission problem for noisy channels is usually studied under the condition that the decoding error probability lambda is small and is sometimes studied under the condition that lambda = 0. Here we just require that lambda < 1 and obtain a problem which is equivalent to a coding problem with small lambda 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 coding theorem for the deterministic broadcast channel.
AU - Ahlswede, Rudolf
AU - Cai, N
ID - 1626351
IS - 2
JF - IEEE TRANSACTIONS ON INFORMATION THEORY
KW - detection
KW - combinatorial matching
KW - zero-error problems
KW - identification
KW - feedback
KW - channel models
KW - new
SN - 0018-9448
TI - Information and control: Matching channels
VL - 44
ER -