Abstract
Capacity expressions are given for four classes of discrete memoryless networks (DMNs). One of the capacity results is a consequence of a new outer bound for common output DMNs. Another result shows that the common practice of using time-sharing random variables does not include all time-sharing possibilities, namely time-sharing of channels.
| Original language | English |
|---|---|
| Pages (from-to) | 25 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2002 |
| Externally published | Yes |
| Event | 2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland Duration: 30 Jun 2002 → 5 Jul 2002 |