Abstract
Two outer bounds on the capacity region of the two-user Gaussian interference channel (IFC) are derived. The idea of the first bound is to let a genie give one of the receivers just enough information to decode both messages. This bound extends to discrete memoryless IFCs and is shown to be equivalent to a bound of Carleial. The second bound follows directly from existing results of Sato and Costa but seems not to have been noticed before.
| Original language | English |
|---|---|
| Pages (from-to) | 103 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2001 |
| Externally published | Yes |
| Event | 2001 IEEE International Symposium on Information Theory (ISIT 2001) - Washington, DC, United States Duration: 24 Jun 2001 → 29 Jun 2001 |