Information and control: matching channels

Author

Ahlswede, Rudolf ; Cai, Ning

Author_Institution

Fak. fur Math., Bielefeld Univ., Germany

fYear

1997

fDate

29 Jun-4 Jul 1997

Firstpage

368

Abstract

Let 𝒳 serve as input alphabet and let 𝒴 serve as output alphabet. By adding dummy letters we can always assume that 𝒳⊂𝒴. The transmission of letters is ruled by a class 𝒲 of stochastic matrices with |𝒳| rows and |𝒴| columns. In addition to the sender and receiver, there is a third person (or device) called controller who decides which matrix W∈𝒲={(w(·|·|s):s∈S) shall govern the transmission of a letter by the sender. The controller knows which codeword the sender wants to transmit. The receiver has no knowledge about the actions of the controller. As code concept appropriate for this situation we introduce a matching code

Keywords

channel capacity; codes; graph theory; probability; bipartite graphs; channel capacity; codeword; combinatorial matching theory; control; controller; dummy letters; information; input alphabet; letters transmission; matching channels; matching code; mathematical structure; matrix; output alphabet; probabilistic coding theory; Bipartite graph; Capacity planning; Codes; Memoryless systems; Probability distribution; Stochastic processes;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on

Conference_Location

Ulm

Print_ISBN

0-7803-3956-8

Type

conf

DOI

10.1109/ISIT.1997.613304

Filename

613304