The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels
Open accessAbstract
Recently, Etkin, Tse, and Wang found the capacity region of the two-user Gaussian interference channel to within 1 bit/s/Hz. A natural goal is to apply this approach to the Gaussian interference channel with an arbitrary number of users. We make progress towards this goal by finding the capacity region of the many-to-one and one-to-many Gaussian interference channels to within a constant number of bits. The result makes use of a deterministic model to provide insight into the Gaussian channel. The deterministic model makes explicit the dimension of signal level. A central theme emerges: the use of lattice codes for alignment of interfering signals on the signal level.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
Self-citationInterference 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
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
Self-citationCommunication Over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis
Maddah-Ali, M. A., Motahari, A. S., & Khandani, A. K. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.926460 · Cited by 1,008
Computation Over Multiple-Access Channels
Nazer, B., & Gastpar, M. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.904785 · Cited by 753
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
How to encode the modulo-two sum of binary sources (Corresp.)
Korner, J., & Marton, K. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056022 · Cited by 355
Interference Alignment and the Degrees of Freedom for the K User Interference Channel
Cadambe, V. R., & Jafar, S. A. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0707.0323 · Cited by 323
Etkin, R., & Ordentlich, E. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2030473 · Cited by 98
On the Degrees-of-Freedom of the K-user Gaussian interference channel
Etkin, R., & Ordentlich, E. (2009) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2009.5205564 · Cited by 93
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
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Compute-and-Forward: Harnessing Interference Through Structured Codes
Nazer, B., & Gastpar, M. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165816 · Cited by 990
Gomadam, K., Cadambe, V. R., & Jafar, S. A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2142270 · Cited by 871
Annapureddy, V. S., & Veeravalli, V. V. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2021380 · Cited by 431
Metadata
- Authors
- Bresler, G., Parekh, A., & Tse, D. N. C.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2010-09
- Volume
- 56
- Issue
- 9
- Pages
- 4566-4592
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2151027523
- Cited by
- 329
- References
- 12
- FWCI
- 40.37
- 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.