ISSN:
1432-2064
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Summary Let X={1,..., a} be the “input alphabet” and Y={1,2} be the “output alphabet”. Let X t =X and Y t =Y for t=1,2,..., X n = $$\mathop \prod \limits_{t = 1}^n $$ X t and Y n = $$\mathop \prod \limits_{t = 1}^n $$ Y t . Let S be any set, C=={w(·¦·¦)s)¦s∈S} be a set of (a×2) stochastic matrices w(·∥·¦s), and S t=S, t=1,..., n. For every s n =(s 1,...,s n )∈ $$\mathop \prod \limits_{t = 1}^n $$ S t define P(·¦·¦s n)= $$\mathop \prod \limits_{t = 1}^n $$ w(y t ¦x t ¦s t ) for every x n=x 1, ⋯, x nεX n and every y n=(y 1, ⋯, y n)εY n. Consider the channel C n ={P(·¦·¦)s n )¦s n ∈S n } with matrices (·¦·¦s), varying arbitrarily from letter to letter. The authors determine the capacity of this channel when a) neither sender nor receiver knows s n, b) the sender knows s n, but the receiver does not, and c) the receiver knows s n, but the sender does not.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00534915
Permalink