The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Topological Interference Management Through Index Coding
Open accessAbstract
This paper studies linear interference networks, both wired and wireless, with no channel state information at the transmitters except a coarse knowledge of the end-to-end one-hop topology of the network that only allows a distinction between weak (zero) and significant (nonzero) channels and no further knowledge of the channel coefficients' realizations. The network capacity (wired) and degrees of freedom (DoF) (wireless) are found to be bounded above by the capacity of an index coding problem for which the antidote graph is the complement of the given interference graph. The problems are shown to be equivalent under linear solutions. An interference alignment perspective is then used to translate the existing index coding solutions into the wired network capacity and wireless network DoF solutions, as well as to find new and unified solutions to different classes of all three problems.
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.
Integrity signals
Registry
Cites
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.
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
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
Self-citationCapacity limits of MIMO channels
Goldsmith, A., Jafar, S. A., Jindal, N., & Vishwanath, S. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2003.810294 · Cited by 2,379
Self-citationMulti-Cell MIMO Cooperative Networks: A New Look at Interference
Gesbert, D., Hanly, S., Huang, H., Shamai Shitz, S., Simeone, O., & Yu, W. (2010) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2010.101202 · Cited by 1,760
Maddah-Ali, M. A., & Niesen, U. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2306938 · Cited by 1,726
Duality, achievable rates, and sum-rate capacity of gaussian mimo broadcast channels
Vishwanath, S., Jindal, N., & Goldsmith, A. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.817421 · Cited by 1,683
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
Sum capacity of the vector Gaussian broadcast channel and uplink–downlink duality
Viswanath, P., & Tse, D. N. C. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.814483 · Cited by 1,290
Gomadam, K., Cadambe, V. R., & Jafar, S. A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2142270 · Cited by 871
Self-citationWireless Network Information Flow: A Deterministic Approach
Avestimehr, A. S., Diggavi, S. N., & Tse, D. N. C. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2110110 · Cited by 844
Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
Conway, J. H., Hardin, R. H., & Sloane, N. J. A. (1996) · Experimental Mathematics · doi:10.1080/10586458.1996.10504585 · Cited by 755
Cited by
A Survey on Mobile Edge Computing: The Communication Perspective
Mao, Y., You, C., Zhang, J., Huang, K., & Letaief, K. B. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2745201 · Cited by 5,607
The Capacity of Private Information Retrieval
Sun, H., & Jafar, S. A. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2689028 · Cited by 447
Self-citationLow-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit
Shi, Y., Zhang, J., & Letaief, K. B. (2016) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2016.2544758 · Cited by 56
Generalized Sparse and Low-Rank Optimization for Ultra-Dense Networks
Shi, Y., Zhang, J., Chen, W., & Letaief, K. B. (2018) · IEEE Communications Magazine · doi:10.1109/mcom.2018.1700472 · Cited by 44
Massive CSI Acquisition for Dense Cloud-RANs With Spatial-Temporal Dynamics
Liu, X., Shi, Y., Zhang, J., & Letaief, K. B. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2797969 · Cited by 11
Metadata
- Authors
- Jafar, S. A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2014-01
- Volume
- 60
- Issue
- 1
- Pages
- 529-568
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W1966060873
- Cited by
- 305
- References
- 27
- FWCI
- 54.63
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Topological Interference Management Through Index Coding. https://app.cochat.ai/papers/10.1109/tit.2013.2285151
- The paper
- Jafar, S. A. (2014). Topological Interference Management Through Index Coding. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2013.2285151
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.