On the complementary Index Coding problem

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 244-248

  Chaudhry, M A R ^a   Asad, Z ^a   Sprintson, A ^a   Langberg, M ^b  

^a Texas AandM University   (United States)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION SOLUTION; BROADCAST CHANNELS; CLIENT NEEDS; CODING PROBLEMS; COMPLEMENTARY PROBLEMS; COMPLEXITY ASSUMPTIONS; LINEAR SOLUTION; MULTICAST SCENARIOS; NP-HARD; PRACTICAL IMPORTANCE; SIDE INFORMATION; UNICAST;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; INFORMATION THEORY; MULTICASTING;

NETWORK CODING;

EID: 80054818961     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6034005     Document Type: Conference Paper

References (18)

1. Y. Birk and T. Kol. Informed-Source Coding-on-Demand (ISCOD) over Broadcast Channels. In Proceedings of INFOCOM'98, 1998.
2. Z. Bar-Yossef, Y. Birk, T. S. Jayram, and T. Kol. Index Coding with Side Information. In Proceedings of 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 197-206, 2006.
3. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft. XORs in the Air: Practical Wireless Network Coding. In Proceedings of SIGCOMM'06, pages 243-254, 2006.
4. B. Hassanabadi, L. Zhang, and S. Valaee. Index coded repetition-based MAC in vehicular ad-hoc networks. In Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference, pages 1180-1185. Institute of Electrical and Electronics Engineers Inc., The, 2009.
5. S. Sorour and S. Valaee. Adaptive network coded retransmission scheme for wireless multicast. In Proceedings of the 2009 IEEE international Symposium on Information Theory, pages 2577-2581. Institute of Electrical and Electronics Engineers Inc., The, 2009.
6. M. A. R. Chaudhry and A. Sprintson. Efficient algorithms for index coding. In IEEE Conference on Computer Communications (INFOCOM) Workshops, 2008., pages 1-4, 2008.
7. Anna Blasiak, Robert D. Kleinberg, and Eyal Lubetzky. Index coding via linear programming. CoRR, abs/1004.1379, 2010.
8. N. Alon, E. Lubetzky, U. Stav, A. Weinstein, and A. Hassidim. Broadcasting with side information. In IEEE 49th Annual IEEE Symposium on Foundations of Computer Science, 2008. FOCS'08, pages 823-832, 2008.
9. S. El Rouayheb, A. Sprintson, and C. Georghiades. On the index coding problem and its relation to network coding and matroid theory. Information Theory, IEEE Transactions on, 56(7):3187-3195, july 2010.
10. M. Langberg and A. Sprintson. On the hardness of approximating the network coding capacity. In IEEE International Symposium on Information Theory (ISIT), 2008, pages 315-319, 2008.
11. M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, San Francisco, CA, USA, 1979.
12. Rong-Chii Duh and Martin Frer. Approximation of k-set cover by semilocal optimization. In In Proc. 29th STOC, pages 256-264. ACM, 1997.
13. V. V. Vazirani. Approximation Algorithms. Springer, Berlin, 2004.
14. R. Yuster and Z. Nutov. Packing directed cycles efficiently. In Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2004.
15. M. Krivelevich, Z. Nutov, M. R. Salavatipour, J. V. Yuster, and R. Yuster. Approximation algorithms and hardness results for cycle packing problems. ACM Transactions on Algorithms (TALG), 3(4):48, 2007.
16. P. D. Seymour. Packing directed circuits fractionally. Combinatorica, 15(2):281-288, 1995.
17. S. Y. El Rouayheb, M. A. R. Chaudhry, and A. Sprintson. On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks. In Proceedings of 2007 Information Theory Workshop (ITW), Lake Tahoe, CA, September 2007.
18. D. Zuckerman. Linear degree extractors and the inapproximability of max clique and chromatic number. In Proceedings of the thirty-eighth Annual ACM Symposium on Theory of Computing (STOC'06), pages 681-690, New York, NY, USA, 2006. ACM.