Batched sparse codes

IEEE Transactions on Information Theory

Volumn 60, Issue 9, 2014, Pages 5322-5346

  Yang, Shenghao ^a   Yeung, Raymond W ^b  

^a TSINGHUA UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

erasure network; fountain codes; Network coding; sparse graph codes

Indexed keywords

CODES (SYMBOLS); COMPLEX NETWORKS; FORWARD ERROR CORRECTION; MULTICASTING;

ENCODING/DECODING; ERASURE NETWORKS; FOUNTAIN CODES; INTERMEDIATE NETWORKS; OPTIMIZATION CRITERIA; RANDOM LINEAR CODING; SPARSE GRAPHS; TRANSMISSION RATES;

NETWORK CODING;

EID: 84906706587     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2014.2334315     Document Type: Article

References (54)

1. M. Luby, "LT codes," in Proc. 43rd Annu. IEEE Symp. Found. Comput. Sci., Nov. 2002, pp. 271-282
2. A. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2551-2567, Jun. 2006
3. P. Maymounkov, "Online codes," Secure Comput. Syst. Group, New York Univ., New York, NY, USA, Tech. Rep. TR2002-833, Nov. 2002
4. 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, Jul. 2000
5. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003
6. R. Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003
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 Int. Symp. Inf. Theory (ISIT), Jun. 2003, p. 442
8. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. Allerton Conf. Comm., Control, Comput., Oct. 2003
9. S. Jaggi, P. A. Chou, and K. Jain, "Low complexity optimal algebraic multicast codes," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jun. 2003
10. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for network information flow," in Proc. 15th ACM Symp. Parallel Algorithms Archit. (SPAA), New York, NY, USA, 2003, pp. 286-294
11. D. S. Lun, M. Medard, R. Koetter, and M. Effros, "On coding for reliable communication over packet networks," Phys. Commun., vol. 1, no. 1, pp. 3-20, Mar. 2008
12. Y. Wu, "A trellis connectivity analysis of random linear network coding with buffering," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Seattle, WA, USA, Jul. 2006, pp. 768-772
13. A. F. Dana, R. Gowaikar, R. Palanki, B. Hassibi, and M. Effros, "Capacity of wireless erasure networks," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 789-804, Mar. 2006
14. S. Chachulski, M. Jennings, S. Katti, and D. Katabi, "Trading structure for randomness in wireless opportunistic routing," ACM SIGCOMM Comput. Commun. Rev., vol. 37, no. 4, pp. 169-180, Aug. 2007
15. C. Gkantsidis and P. R. Rodriguez, "Network coding for large scale content distribution," in Proc. IEEE 24th Annu. Joint Conf. IEEE Comput. Commun. Soc. (INFOCOM), Mar. 2005, pp. 2235-2245
16. M. Wang and B. Li, "Lava: A reality check of network coding in peerto-peer live streaming," in Proc. 26th IEEE Int. Conf. Comput. Commun. (INFOCOM), May 2007, pp. 1082-1090
17. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Médard, and J. Crowcroft, "XORs in the air: Practical wireless network coding," in Proc. Conf. Appl., Technol., Archit., Protocols Comput. Commun. (SIGCOMM), New York, NY, USA, 2006
18. P. Maymounkov, N. J. A. Harvey, and D. S. Lun, "Methods for efficient network coding," in Proc. Allerton Conf. Commun., Control, Comput., Sep. 2006
19. S. Yang and R. W. Yeung, "Large file transmission in network-coded networks with packet loss: A performance perspective," in Proc. 4th Int. Symp. Appl. Sci. Biomed. Commun. Technol. (ISABEL), Barcelona, Spain, Oct. 2011
20. D. Silva, W. Zeng, and F. R. Kschischang, "Sparse network coding with overlapping classes," in Proc. Workshop Netw. Coding, Theory, Appl. (NetCod), Jun. 2009, pp. 74-79
21. A. Heidarzadeh and A. H. Banihashemi, "Overlapped chunked network coding," in Proc. IEEE Inf. Theory Workshop (ITW), Jan. 2010, pp. 1-5
22. 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. Inf. Theory, vol. 57, no. 2, pp. 1111-1123, Feb. 2011
23. B. Tang, S. Yang, Y. Yin, B. Ye, and S. Lu, "Expander graph based overlapped chunked codes," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Cambridge, MA, USA, Jul. 2012, pp. 2451-2455
24. K. Mahdaviani, M. Ardakani, H. Bagheri, and C. Tellambura, "Gamma codes: A low-overhead linear-complexity network coding solution," in Proc. Int. Symp. Netw. Coding (NetCod), Jun. 2012, pp. 125-130
25. K. Mahdaviani, R. Yazdani, and M. Ardakani, "Overhead-optimized gamma network codes," in Proc. Int. Symp. Netw. Coding (NetCod), Sep. 2013
26. P. Pakzad, C. Fragouli, and A. Shokrollahi, "Coding schemes for line networks," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Sep. 2005, pp. 1853-1857
27. R. Gummadi and R. S. Sreenivas, "Relaying a fountain code across multiple nodes," in Proc. IEEE Inf. Theory Workshop (ITW), May 2008, pp. 149-153
28. M.-L. Champel, K. Huguenin, A.-M. Kermarrec, and N. Le Scouarnec, "LT network codes," in Proc. IEEE 30th Int. Conf. Distrib. Comput. Syst. (ICDCS), Jun. 2010, pp. 536-546
29. N. Thomos and P. Frossard, "Degree distribution optimization in Raptor network coding," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul./Aug. 2011, pp. 2736-2740
30. M. Jafari, L. Keller, C. Fragouli, and K. Argyraki, "Compressed network coding vectors," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jun./Jul. 2009, pp. 109-113
31. C. Fragouli, D. Lun, M. Medard, and P. Pakzad, "On feedback for network coding," in Proc. 41st Annu. Conf. Inform. Sci. Syst. (CISS), Mar. 2007, pp. 248-252
32. L. Keller, E. Drinea, and C. Fragouli, "Online broadcasting with network coding," in Proc. 4th Workshop Netw. Coding, Theory Appl. (NetCod), Jan. 2008, pp. 1-6
33. J. K. Sundararajan, D. Shah, and M. Medard, "ARQ for network coding," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2008, pp. 1651-1655
34. S. Jaggi, Y. Cassuto, and M. Effros, "Low complexity encoding for network codes," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2006, pp. 40-44
35. R. Koetter and F. R. Kschischang, "Coding for errors and erasures in random network coding," IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3579-3591, Aug. 2008
36. D. Silva, F. R. Kschischang, and R. Koetter, "Communication over finite-field matrix channels," IEEE Trans. Inf. Theory, vol. 56, no. 3, pp. 1296-1305, Mar. 2010
37. S. Yang, J. Meng, and E.-H. Yang, "Coding for linear operator channels over finite fields," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jun. 2010
38. N. C. Wormald, "The differential equation method for random graph processes and greedy algorithms," in Lectures on Approximation and Randomized Algorithms, M. Karonski and H.-J. Prömel, Eds. Warsaw, Poland: PWN, 1999, pp. 73-155
39. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001
40. T. Richardsan and R. Urbanke, Modern Coding Theory. Cambridge, U.K.: Cambridge Univ. Press, 2008
41. G. E. Andrews, The Theory of Partitions (Encyclopedia of mathematics and its applications). Reading, MA, USA: Addison-Wesley, 1976
42. M. Gadouleau and Z. Yan, "Packing and covering properties of subspace codes for error control in random linear network coding," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2097-2108, May 2010
43. N. C. Wormald, "Differential equations for random processes and random graphs," Ann. Appl. Probab., vol. 5, no. 4, pp. 1217-1235, 1995
44. N. A. Smith and R. W. Tromble. (2004). Sampling Uniformly from the Unit Simplex [Online]. Available: Http://www.cs.cmu.edu/~nasmith/papers/ smith+tromble.tr04.pdf
45. S. Yang and Y. Chen. (2013). Degree-Distribution Optimizations of BATS Codes [Online]. Available: Http://iiis.tsinghua.edu.cn/~shenghao/pub/ddo.pdf
46. A. Shokrollahi and M. Luby, Raptor Codes (Foundations and Trends in Communications and Information Theory), vol. 6. Boston, MA, USA: NOW, 2011
47. M. Luby, A. Shokrollahi, M. Watson, T. Stockhammer, and L. Minder. (2011). RaptorQ Forward Error Correction Scheme for Object Delivery-RFC 6330 [Online]. Available: Http://datatracker.ietf.org/doc/rfc6330/
48. B. A. LaMacchia and A. M. Odlyzko, "Solving large sparse linear systems over finite fields," in Proc. Adv. Cryptol.-CRYPT0, 1991, pp. 109-133
49. C. Pomerance and J. W. Smith, "Reduction of huge, sparse matrices over finite fields via created catastrophes," Experim. Math., vol. 1, no. 2, pp. 89-94, 1992
50. 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
51. T. J. Richardson and R. L. Urbanke, "Efficient encoding of lowdensity parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001
52. T. C. Ng and S. Yang, "Finite length analysis of BATS codes," in Proc. Int. Conf. Netw. Coding (NetCod), Calgary, AB, Canada, Jun. 2013, pp. 1-6
53. T. C. Ng and S. Yang, "Finite-length analysis of BATS codes," arXiv:1312.4811, 2013
54. M. Zelen and N. C. Severo, Handbook of Mathematical Functions With Formulas, Graphs, and Mathematical Tables, M. Abramowitz and A. Stegun, Eds. New York, NY, USA: Dover, 1972. China