The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Index Coding With Side Information
Abstract
Motivated by a problem of transmitting supplemental data over broadcast channels (Birk and Kol, INFOCOM 1998), we study the following coding problem: a sender communicates with n receivers R1,..., Rn. He holds an input x ∈ {0,01l}nand wishes to broadcast a single message so that each receiver Ri can recover the bit xi. Each Rihas prior side information about x, induced by a directed graph Grain nodes; Ri knows the bits of a; in the positions {j | (i,j) is an edge of G}.G is known to the sender and to the receivers. We call encoding schemes that achieve this goal INDEXcodes for {0,1}nwith side information graph G. In this paper we identify a measure on graphs, the minrank, which exactly characterizes the minimum length of linear and certain types of nonlinear INDEX codes. We show that for natural classes of side information graphs, including directed acyclic graphs, perfect graphs, odd holes, and odd anti-holes, minrank is the optimal length of arbitrary INDEX codes. For arbitrary INDEX codes and arbitrary graphs, we obtain a lower bound in terms of the size of the maximum acyclic induced subgraph. This bound holds even for randomized codes, but has been shown not to be tight.
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
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Ahlswede, R., Cai, N., Li, S.-Y. R., & Yeung, R. W. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850663 · Cited by 7,814
Noiseless coding of correlated information sources
Slepian, D., & Wolf, J. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055037 · Cited by 3,952
An information statistics approach to data stream and communication complexity
Bar-Yossef, Z., Jayram, T. S., Kumar, R., & Sivakumar, D. (2004) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2003.11.006 · Cited by 606
Self-citationBirk, Y., & Kol, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874540 · Cited by 324
Self-citationOn the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
El Rouayheb, S., Sprintson, A., & Georghiades, C. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2048502 · Cited by 293
Dense quantum coding and quantum finite automata
Ambainis, A., Nayak, A., Ta-Shma, A., & Vazirani, U. (2002) · Journal of the ACM · doi:10.1145/581771.581773 · Cited by 258
Informational complexity and the direct sum problem for simultaneous message complexity
Chakrabarti, A., Shi, Y., Wirth, A., & Yao, A. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959901 · Cited by 255
The zero-error side information problem and chromatic numbers (Corresp.)
Witsenhausen, H. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055607 · Cited by 187
Cited by
Maddah-Ali, M. A., & Niesen, U. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2306938 · Cited by 1,726
Speeding Up Distributed Machine Learning Using Codes
Lee, K., Lam, M., Pedarsani, R., Papailiopoulos, D., & Ramchandran, K. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2736066 · Cited by 829
A Fundamental Tradeoff Between Computation and Communication in Distributed Computing
Li, S., Maddah-Ali, M. A., Yu, Q., & Avestimehr, A. S. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2756959 · Cited by 451
Private information retrieval with side information: The single server case
Kadhe, S., Garcia, B., Heidarzadeh, A., Rouayheb, S. E., & Sprintson, A. (2017) · 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2017.8262860 · Cited by 38
Metadata
- Authors
- Bar-Yossef, Z., Birk, Y., Jayram, T. S., & Kol, T.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2011-03
- Volume
- 57
- Issue
- 3
- Pages
- 1479-1494
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2130507035
- Cited by
- 498
- References
- 11
- Type
- paratext
- 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: Index Coding With Side Information. https://app.cochat.ai/papers/10.1109/tit.2010.2103753
- The paper
- Bar-Yossef, Z., Birk, Y., Jayram, T. S., & Kol, T. (2011). Index Coding With Side Information. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2010.2103753
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.