The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Gaussian Interference Networks: Sum Capacity in the Low-Interference Regime and New Outer Bounds on the Capacity Region
Open accessAbstract
Establishing the capacity region of a Gaussian interference network is an open problem in information theory. Recent progress on this problem has led to the characterization of the capacity region of a general two-user Gaussian interference channel within one bit. In this paper, we develop new, improved outer bounds on the capacity region. Using these bounds, we show thattreatinginterferenceasnoiseachieves thesumcapacityof the two-user Gaussian interference channel in alow-interferenceregime, where the interference parameters are below certain thresholds. We then generalize our techniques and results to Gaussian interference networks with more than two users. In particular, we demonstrate that the total interference threshold, below which treating interference as noise achieves the sum capacity, increases with the number of users.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
A new achievable rate region for the interference channel
Han, T., & Kobayashi, K. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056307 · Cited by 1,588
Gaussian Interference Channel Capacity to Within One Bit
Etkin, R. H., Tse, D. N. C., & Wang, H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2006447 · Cited by 1,370
Carleial, A. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055812 · Cited by 694
The capacity of the Gaussian interference channel under strong interference (Corresp.)
Sato, H. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056416 · Cited by 623
A case where interference does not reduce capacity (Corresp.)
Carleial, A. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055432 · Cited by 533
Capacity Bounds for the Gaussian Interference Channel
Motahari, A. S., & Khandani, A. K. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2009807 · Cited by 430
The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels
Bresler, G., Parekh, A., & Tse, D. N. C. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054590 · Cited by 329
On The Han–Kobayashi Region for theInterference Channel
Chong, H.-F., Motani, M., Garg, H. K., & El Gamal, H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.924720 · Cited by 314
Outer Bounds on the Capacity of Gaussian Interference Channels
Kramer, G. G. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.825249 · Cited by 270
An Extremal Inequality Motivated by Multiterminal Information-Theoretic Problems
Liu, T., & Viswanath, P. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.894680 · Cited by 215
Mathematics of Information and Coding
Han, T. S., & Kobayashi, K. (2007) · Translations of mathematical monographs · doi:10.1090/mmono/203 · Cited by 110
Mathematics of information and coding
韓, 太., & 小林, 欣. (2002) · American Mathematical Society eBooks · Cited by 76
Cited by
Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel
Cadambe, V. R., & Jafar, S. A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.926344 · Cited by 2,970
Breaking Spectrum Gridlock With Cognitive Radios: An Information Theoretic Perspective
Goldsmith, A., Jafar, S. A., Maric, I., & Srinivasa, S. (2009) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2015717 · Cited by 2,398
Massive MIMO Networks: Spectral, Energy, and Hardware Efficiency
Björnson, E., Hoydis, J., & Sanguinetti, L. (2017) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000093 · Cited by 2,137
A Survey on Device-to-Device Communication in Cellular Networks
Asadi, A., Wang, Q., & Mancuso, V. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2319555 · Cited by 1,824
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Metadata
- Authors
- Annapureddy, V. S., & Veeravalli, V. V.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2009-07
- Volume
- 55
- Issue
- 7
- Pages
- 3032-3050
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2130781639
- Cited by
- 431
- References
- 16
- FWCI
- 41.18
- Type
- journal article
- Language
- en
- Open access
- green
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
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.