Deterministic Algorithm for Coded Cooperative Data Exchange

Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST

Volumn 74 LNICST, Issue , 2012, Pages 282-289

  Sprintson, Alex ^a   Sadeghi, Parastoo ^b   Booker, Graham ^a   El Rouayheb, Salim ^c  

^a TEXAS A AND M UNIVERSITY   (United States)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCAST CHANNELS; DETERMINISTIC ALGORITHMS; NUMBER OF TRANSMISSIONS; OPTIMAL SOLUTIONS; POLYNOMIAL-TIME; WIRELESS CLIENT;

ALGORITHMS; HETEROGENEOUS NETWORKS; POLYNOMIAL APPROXIMATION; RELIABILITY;

ELECTRONIC DATA INTERCHANGE;

EID: 84885002139     PISSN: 18678211     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-29222-4_20     Document Type: Conference Paper

References (17)

1. Ahlswede, R., Cai, N., Li, S.-Y.R., Yeung, R.W.: Network Information Flow. IEEE Trans. Inf. Theory 46(4), 1204-1216 (2000)
2. Alon, N., Hassidim, A., Lubetzky, E., Stav, U., Weinstein, A.: Broadcasting with Side Information. In: Proc. of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 823-832 (2008)
3. Bar-Yossef, Z., Birk, Y., Jayram, T.S., Kol, T.: Index Coding With Side Information. In: Proc. of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 197-206 (2006)
4. Birk, Y., Kol, T.: Coding-On-Demand by an Informed Source (ISCOD) for Efficient Broadcast of Different Supplemental Data to Caching Clients. IEEE Trans. Inf. Theory 52(6), 2825-2830 (2006)
5. Blasiak, A., Kleinberg, R., Lubetzky, E.: Index Coding via Linear Programming. IEEE Trans. Inf. Theory (April 2010) (submitted for publication), http://arxiv.org/abs/1004.1379
6. Courtade, T., Wesel, R.: Efficient Universal Recovery in Broadcast Networks. In: 48th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA (September-October 2010)
7. Courtade, T., Wesel, R.D.: A Deterministic Approach to Rate-Compatible Fountain Communication. In: Information Theory and Applications Workshop (ITA), San Diego, CA, USA (January/February 2010)
8. El Rouayheb, S., Sprintson, A., Georghiades, C.: On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory. IEEE Transactions on Information Theory 56(7), 3187-3195 (2010)
9. Hong, Y.-W., Huang, W.-J., Chiu, F.-H., Kuo, C.-C.J.: Cooperative Communications in Resource-Constrained Wireless Networks. IEEE Signal Process. Mag. 24(3), 47-57 (2007)
10. Jaggi, S., Sanders, P., Chou, P.A., Effros, M., Egner, S., Jain, K., Tolhuizen, L.: Polynomial Time Algorithms for Multicast Network Code Construction. IEEE Trans. Inf. Theory 51(6), 1973-1982 (2005)
11. Katti, S., Rahul, H., Hu, W., Katabi, D., Médard, M., Crowcroft, J.: XORs in The Air: Practical Wireless Network Coding. In: Proc. of ACM SIGCOMM, Pisa, Italy (2006)
12. Koetter, R., Médard, M.: An Algebraic Approach to Network Coding. IEEE/ACMTrans. on Networking 11(5), 782-795 (2003)
13. Laneman, J.N., Tse, D.N.C., Wornell, G.W.: Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior. IEEE Trans. Inf. Theory 50(12), 3062-3080 (2004)
14. Minsky, Y., Trachtenberg, A., Zippel, R.: Set Reconciliation with Nearly Optimal Communication Complexity. IEEE Trans. Inf. Theory 49(9), 2213-2218 (2003)
15. Sendonaris, A., Erkip, E., Aazhang, B.: User Cooperation Diversity-Part I: System Description. IEEE Trans. Commun. 51(11), 1927-1938 (2003)
16. Shah, D.: Gossip algorithms. Foundations and Trends in Networking 3(1) (2007)
17. Sprintson, A., Sadeghi, P., Booker, G., El Rouayheb, S.: A Randomized Algorithm and Performance Bounds for Coded Cooperative Data Exchange. In: Proceedings of 2010 IEEE International Symposium on Information Theory (ISIT 2010), Austin, Texas, USA (June 2010)