A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A new upper bound on the capacity of a class of primitive relay channels

2008
*
2008 46th Annual Allerton Conference on Communication, Control, and Computing
*

We obtain a new upper bound on the capacity of a class of discrete memoryless relay channels. For this class of relay channels, the relay observes an i.i.d. sequence T , which is independent of the channel input X. The channel is described by a set of probability transition functions p(y|x, t) for all (x, t, y) ∈ X × T × Y. Furthermore, a noiseless link of finite capacity R0 exists from the relay to the receiver. Although the capacity for these channels is not known in general, the capacity of

doi:10.1109/allerton.2008.4797748
fatcat:jnywtzxefbfsvc5ebzcveknygy