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.
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 103 |
| Seitenumfang | 1 |
| Fachzeitschrift | IEEE International Symposium on Information Theory - Proceedings |
| Publikationsstatus | Veröffentlicht - 2001 |
| Extern publiziert | Ja |
| Veranstaltung | 2001 IEEE International Symposium on Information Theory (ISIT 2001) - Washington, DC, USA/Vereinigte Staaten Dauer: 24 Juni 2001 → 29 Juni 2001 |