On the capacity region for index coding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2013, Pages 962-966

  Arbabjolfaei, Fatemeh ^a   Bandemer, Bernd ^a   Kim, Young Han ^a   Sasoglu, Eren ^a   Wang, Lele ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITY REGIONS; GENERAL INDEX; GRAPH-THEORETIC; INDEX CODING; NON-ISOMORPHIC; OPTIMAL DECODING; RANDOM CODING;

GRAPH THEORY;

INFORMATION THEORY;

EID: 84890421213     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2013.6620369     Document Type: Conference Paper

References (28)

1. M. Langberg and M. Effros, "Network coding: Is zero error always possible?" in Proc. 49th Ann. Allerton Conf. Comm. Control Comput., Monticello, IL, Sep. 2011, pp. 1478-1485.
2. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, 2000.
3. Y. Birk and T. Kol, "Informed-source coding-on-demand (ISCOD) over broadcast channels," in Proc. 17th Ann. IEEE Int. Conf. Comput. Commun. (INFOCOM), San Francisco, CA, Mar. 1998, pp. 1257-1264.
4. N. Alon, E. Lubetzky, U. Stav, A. Weinstein, and A. Hassidim, "Broadcasting with side information," in 49th Ann. IEEE Symp. Found. Comput. Sci., Philadelphia, PA, Oct. 2008, pp. 823-832.
5. Y. Wu, J. Padhye, R. Chandra, V. Padmanabhan, and P. A. Chou, "The local mixing problem," in Proc. UCSD Inf. Theory Appl. Workshop, La Jolla, CA, 2006.
6. E. Lubetzky and U. Stav, "Nonlinear index coding outperforming the linear optimum," IEEE Trans. Inf. Theory, vol. 55, no. 8, pp. 3544-3551, Aug. 2009.
7. S. El Rouayheb, A. Sprintson, and C. Georghiades, "On the index coding problem and its relation to network coding and matroid theory," IEEE Trans. Inf. Theory, vol. 56, no. 7, pp. 3187-3195, Jul. 2010.
8. Z. Bar-Yossef, Y. Birk, T. S. Jayram, and T. Kol, "Index coding with side information," IEEE Trans. Inf. Theory, vol. 57, no. 3, pp. 1479-1494, Mar. 2011.
9. Y. Berliner and M. Langberg, "Index coding with outerplanar side information," in Proc. IEEE Int. Symp. Inf. Theory, Saint Petersburg, Russia, Aug. 2011, pp. 806-810.
10. A. Blasiak, R. Kleinberg, and E. Lubetzky, "Lexicographic products and the power of non-linear network coding," in 52nd Ann. IEEE Symp. Found. Comput. Sci., Palm Springs, CA, Oct. 2011, pp. 609-618.
11. -, "Index coding via linear programming," 2011. [Online]. Available: http://arxiv.org/abs/1004.1379/
12. S. H. Dau, V. Skachek, and Y. M. Chee, "Optimal index codes with near-extreme rates," in Proc. IEEE Int. Symp. Inf. Theory, Cambridge, MA, Jul. 2012, pp. 2241-2245.
13. M. Effros, S. El Rouayheb, and M. Langberg, "An equivalence between network coding and index coding," 2012. [Online]. Available: http://arxiv.org/abs/1211.6660/
14. I. Haviv and M. Langberg, "On linear index coding for random graphs," in Proc. IEEE Int. Symp. Inf. Theory, Cambridge, MA, Jul. 2012, pp. 2231-2235.
15. A. Tehrani, A. G. Dimakis, and M. Neely, "Bipartite index coding," in Proc. IEEE Int. Symp. Inf. Theory, Cambridge, MA, Jul. 2012, pp. 2246-2250.
16. K. Shanmugam, A. G. Dimakis, and M. Langberg, "Local graph coloring and index coding," 2013. [Online]. Available: http://arxiv.org/abs/1301. 5359/
17. H. Maleki, V. R. Cadambe, and S. A. Jafar, "Index coding: An interference alignment perspective," in Proc. IEEE Int. Symp. Inf. Theory, Cambridge, MA, Jul. 2012, pp. 2236-2240.
18. V. R. Cadambe and S. A. Jafar, "Interference alignment and degrees of freedom of the K-user interference channel," IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3425-3441, Aug. 2008.
19. A. H. Maslow, The Psychology of Science: A Reconnaissance. New York: Harper &Row, 1966.
20. R. Dougherty, C. Freiling, and K. Zeger, "Network coding and matroid theory," Proc. IEEE, vol. 99, no. 3, pp. 388-405, Mar. 2011.
21. H. Sun and S. A. Jafar, "Index coding capacity: How far can one go with only Shannon inequalities?" 2013. [Online]. Available: http://arxiv.org/abs/1303.7000/
22. H.-F. Chong, M. Motani, H. K. Garg, and H. El Gamal, "On the Han-Kobayashi region for the interference channel," IEEE Trans. Inf. Theory, vol. 54, no. 7, pp. 3188-3195, Jul. 2008.
23. A. El Gamal and Y.-H. Kim, Network Information Theory. Cambridge: Cambridge University Press, 2011.
24. N. J. A. Sloane, "Sequence A000273: Number of directed graphs (or digraphs) with n nodes," in The On-Line Encyclopedia of Integer Sequences, 2013, published electronically at http://oeis.org/A000273/.
25. T. S. Han, "The capacity region of general multiple-access channel with certain correlated sources," Inf. Control, vol. 40, no. 1, pp. 37-60, 1979.
26. B. Bandemer, A. El Gamal, and Y.-H. Kim, "Simultaneous nonunique decoding is rate-optimal," in Proc. 50th Ann. Allerton Conf. Comm. Control Comput., Monticello, IL, Oct. 2012.
27. M. Terzer, "Large scale methods to enumerate extreme rays and elementary modes," Ph.D. dissertation, Swiss Federal Institute of Technology (ETH), Zurich, 2009.
28. J. G. Oxley, Matroid Theory. Oxford: Oxford University Press, 2006.