Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 430

The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.

Capacity Bounds for the Gaussian Interference Channel

Motahari, Abolfazl Seyed, Khandani, Amir Keyvan · 2009 · IEEE Transactions on Information Theory

Abstract

The capacity region of the two-user Gaussian interference channel (IC) is studied. Three classes of channels are considered: weak, one-sided, and mixed Gaussian ICs. For the weak Gaussian IC, a new outer bound on the capacity region is obtained that outperforms previously known outer bounds. The sum capacity for a certain range of channel parameters is derived. For this range, it is proved that using Gaussian codebooks and treating interference as noise are optimal. It is shown that when Gaussian codebooks are used, the full Han–Kobayashi achievable rate region can be obtained by using the naive Han–Kobayashi achievable scheme over three frequency bands (equivalently, three subspaces). For the one-sided Gaussian IC, an alternative proof for the Sato's outer bound is presented. We derive the full Han–Kobayashi achievable rate region when Gaussian codebooks are utilized. For the mixed Gaussian IC, a new outer bound is obtained that outperforms previously known outer bounds. For this case, the sum capacity for the entire range of channel parameters is derived. It is proved that the full Han–Kobayashi achievable rate region using Gaussian codebooks is equivalent to that of the one-sided Gaussian IC for a particular range of channel parameters.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.2008.2009807

Cites

14 of 14 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 14 references

Cited by

See all 430

Metadata

Authors
Motahari, A. S., & Khandani, A. K.
Venue
IEEE Transactions on Information Theory
Published
2009-02
Volume
55
Issue
2
Pages
620-643
ISSN
0018-9448 (ISSN-L)
OpenAlex
W2062610219
Cited by
430
References
14
FWCI
80.14
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Capacity Bounds for the Gaussian Interference Channel. https://app.cochat.ai/papers/10.1109/tit.2008.2009807
The paper
Motahari, A. S., & Khandani, A. K. (2009). Capacity Bounds for the Gaussian Interference Channel. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2008.2009807

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.