Non-linear index coding outperforming the linear optimum

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 161-168

  Lubetzky, Eyal ^a   Stav, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; EIGENVALUES AND EIGENFUNCTIONS; FIBER OPTIC CHEMICAL SENSORS; PROGRAMMING THEORY;

NON-LINEAR; SOURCE CODING;

FOUNDATIONS;

EID: 46749126206     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389489     Document Type: Conference Paper

References (13)

1. N. Alon, The Shannon capacity of a union, Combinatorica 18 (1998), 301-310.
2. N. Alon, E. Lubetzky and U. Stav, The index coding rate of a graph, preprint.
3. D.A.M. Barrington, R. Beigel, and S. Rudich, Representing boolean functions as polynomials modulo composite numbers, Computational Complexity 4 (1994), 367-382.
4. An extended abstract appeared in Proc. of the 24th Annual ACM symposium on Theory of computing (STOC 1992), pp. 462-467.
5. Z. Bar-Yossef, Y. Birk, T.S. Jayram and T. Kol, Index coding with side information, Proc. of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 197-206.
6. Y. Birk and T. Kol, Coding-on-demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients, IEEE Transactions on Information Theory 52 (2006), 2825-2830. An earlier version appeared in INFOCOM '98.
7. R.C. Bollinger and C.L. Burchard, Lucas's Theorem and some related results for extended Pascal triangles, The American Mathematical Monthly 97 (1990), pp. 198-204.
8. P. Frankl and R. Wilson, Intersection theorems with geometric consequences, Combinatorica 1 (1981), 357-368.
9. W. Haemers, An upper bound for the Shannon capacity of a graph, Colloq. Math. Soc. János Bolyai 25, Algebraic Methods in Graph Theory, Szeged, Hungary (1978), 267-272.
10. W. Haemers, On some problems of Lovász concerning the Shannon capacity of a graph, IEEE Transactions on Information Theory 25 (1979), 231-232.
11. L. Lovász, On the Shannon capacity of a graph, IEEE Transactions on Information Theory 25 (1979), 1-7.
12. C.E. Shannon, The zero-error capacity of a noisy channel, IRE Transactions on Information Theory, 2(3) (1956), 8-19.
13. H. S. Witsenhausen, The zero-error side information problem and chromatic numbers, IEEE Transactions on Information Theory, 22(5) (1976), 592-593.