BATS: Network coding in action

2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014

Volumn , Issue , 2014, Pages 1204-1211

  Yang, Shenghao ^a   Yeung, Raymond W ^b   Cheung, Jay H F ^b   Yin, Hoover H F ^b  

^a TSINGHUA UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPLEX NETWORKS; LINEAR NETWORKS; NETWORK PROTOCOLS; OPTIMAL SYSTEMS; PACKET LOSS;

MULTIHOP NETWORKS; OPTIMALITY; PRACTICAL ISSUES; RANDOM LINEAR NETWORK CODING;

NETWORK CODING;

EID: 84988267075     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2014.7028592     Document Type: Conference Paper

References (32)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inform. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
2. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inform. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
3. R. Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 782-795, Oct. 2003.
4. M. Luby, "LT codes," in Proc. IEEE FOCS '02, Nov. 2002, pp. 271-282.
5. A. Shokrollahi, "Raptor codes," IEEE Trans. Inform. Theory, vol. 52, no. 6, pp. 2551-2567, Jun. 2006.
6. P. Maymounkov, "Online codes," NYU, Tech. Rep., Nov. 2002.
7. T. Ho, B. Leong, M. Medard, R. Koetter, Y. Chang, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. IEEE ISIT '03, Jun. 2003.
8. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. Allerton Conf. Comm., Control, and Computing, Oct. 2003.
9. S. Jaggi, P. A. Chou, and K. Jain, "Low complexity optimal algebraic multicast codes," in Proc. IEEE ISIT '03, Jun. 2003.
10. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for network information flow," in Proc. ACM SPAA '03, New York, NY, USA, 2003, pp. 286-294.
11. D. S. Lun, M. Médard, R. Koetter, and M. Effros, "On coding for reliable communication over packet networks," Physical Communication, vol. 1, no. 1, pp. 3-20, 2008.
12. Y. Wu, "A trellis connectivity analysis of random linear network coding with buffering," in Proc. IEEE ISIT '06, Seattle, USA, Jul. 2006.
13. A. F. Dana, R. Gowaikar, R. Palanki, B. Hassibi, and M. Effros, "Capacity of wireless erasure networks," IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 789-804, 2006.
14. C. Gkantsidis and P. Rodriguez, "Network coding for large scale content distribution," in Proc. IEEE INFOCOM '05, 2005.
15. D. Silva, W. Zeng, and F. R. Kschischang, "Sparse network coding with overlapping classes," in Proc. NetCod '09, 2009, pp. 74-79.
16. A. Heidarzadeh and A. H. Banihashemi, "Overlapped chunked network coding," in Proc. ITW '10, 2010, pp. 1-5.
17. Y. Li, E. Soljanin, and P. Spasojevic, "Effects of the generation size and overlap on throughput and complexity in randomized linear network coding," IEEE Trans. Inform. Theory, vol. 57, no. 2, pp. 1111-1123, Feb. 2011.
18. B. Tang, S. Yang, Y. Yin, B. Ye, and S. Lu, "Expander graph based overlapped chunked codes," in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, Cambridge, MA, USA, July 1-6 2012, pp. 2451-2455.
19. -, "Expander graph based overlapped chunked codes," 2013, submitted for journal publication.
20. S. Yang and R. W. Yeung, "Coding for a network coded fountain," in Proc. IEEE ISIT '11, Saint Petersburg, Russia, Aug. 2011.
21. -, "Batched sparse codes," 2014, accepted by IEEE Transactions on Information Theory. [Online]. Available: http://arxiv.org/abs/1206.5365
22. K. Mahdaviani, M. Ardakani, H. Bagheri, and C. Tellambura, "Gamma codes: A low-overhead linear-complexity network coding solution," in Proc. NetCod '12, 2012, pp. 125-130.
23. K. Mahdaviani, R. Yazdani, and M. Ardakani, "Linear-complexity overhead-optimized random linear network codes." [Online]. Available: http://arxiv.org/abs/1311.2123
24. S. Yang and B. Tang, "From LDPC to chunked network codes," accepted by Information Theory Workshop (ITW), 2014 IEEE.
25. S. Yang and R. W. Yeung, "Subset coding for communication systems," US Patent US 8,693,501, 2014.
26. Q. Huang, K. Sun, X. Li, and D. Wu, "Just fun: A joint fountain coding and network coding approach to loss-tolerant information spreading," in Proceedings of ACM MobiHoc, Philadelphia, PA, USA, Aug. 2014.
27. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Médard, and J. Crowcroft, "XORs in the air: Practical wireless network coding," in Proc. SIGCOMM '06, New York, NY, USA, 2006.
28. A. Shokrollahi and M. Luby, Raptor Codes, ser. Foundations and Trends in Communications and Information Theory. now, 2011, vol. 6.
29. M. Luby, A. Shokrollahi, M. Watson, T. Stockhammer, and L. Minder, "RaptorQ forward error correction scheme for object delivery-rfc 6330," 2011. [Online]. Available: http://datatracker.ietf.org/doc/rfc6330/
30. A. Shokrollahi, S. Lassen, and R. Karp, "Systems and processes for decoding chain reaction codes through inactivation," U.S. Patent 6,856,263, Feb. 15, 2005.
31. T. C. Ng and S. Yang, "Finite length analysis of BATS codes," in Proc. IEEE Inte. Symp. on Network Coding NetCod '13, Calgary, Canada, Jun. 7-9 2013.
32. -, "Finite-length analysis of BATS codes," 2013, submitted for journal publication. [Online]. Available: http://arxiv.org/abs/1312.4811