Information and control: Matching channels
Ahlswede, Rudolf
Cai, Ning
detection
combinatorial matching
zero-error problems
identification
feedback
channel models
new
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.
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
1998
info:eu-repo/semantics/article
doc-type:article
text
https://pub.uni-bielefeld.de/record/1626351
Ahlswede R, Cai N. Information and control: Matching channels. <em>IEEE TRANSACTIONS ON INFORMATION THEORY</em>. 1998;44(2):542-563.
eng
info:eu-repo/semantics/altIdentifier/doi/10.1109/18.661504
info:eu-repo/semantics/altIdentifier/issn/0018-9448
info:eu-repo/semantics/altIdentifier/wos/000072248600010
info:eu-repo/semantics/closedAccess