From LDPC to chunked network codes

2014 IEEE Information Theory Workshop, ITW 2014

Volumn , Issue , 2014, Pages 406-410

  Yang, Shenghao ^a   Tang, Bin ^b  

^a TSINGHUA UNIVERSITY   (China)

^b NANJING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; ENCODING (SYMBOLS); FORWARD ERROR CORRECTION; LINEAR NETWORKS; TRANSFER MATRIX METHOD;

BELIEF PROPAGATION DECODING; COEFFICIENT VECTOR; COMPUTATIONAL COSTS; INTERMEDIATE NETWORKS; LDPC CODES; RANK DISTRIBUTIONS; TRANSFER MATRIXES;

NETWORK CODING;

EID: 84929300623     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2014.6970863     Document Type: Conference Paper

References (19)

1. S.-Y. Li, R. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
2. T. Ho, R. Koetter, M. Medard, D. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. IEEE ISIT '03, Jun. 2003, p. 442.
3. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. Allerton Conf. Comm., Control, and Computing, Oct. 2003.
4. 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, 2006.
5. D. S. Lun, M. Medard, R. Koetter, and M. Effros, "On coding for reliable communication over packet networks," Physical Commun., vol. 1, no. 1, pp. 3-20, 2008.
6. C. Gkantsidis and P. Rodriguez, "Network coding for large scale content distribution," in Proc. IEEE INFOCOM '05, 2005.
7. D. Silva, W. Zeng, and F. R. Kschischang, "Sparse network coding with overlapping classes," in Proc. NetCod '09, 2009, pp. 74-79.
8. A. Heidarzadeh and A. H. Banihashemi, "Overlapped chunked network coding," in Proc. IEEE ITW '10, 2010, pp. 1-5.
9. 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.
10. B. Tang, S. Yang, Y. Yin, B. Ye, and S. Lu, "Expander graph based overlapped chunked codes," in Proc. IEEE ISIT '12, Cambridge, MA, USA, Jul. 1-6 2012.
11. -, "Expander chunked codes," 2013, submitted for journal publication.
12. S. Yang and R. W. Yeung, "Coding for a network coded fountain," in Proc. IEEE ISIT '11, Saint Petersburg, Russia, Aug. 2011.
13. -, "Batched sparse codes," 2014, accepted by IEEE Transactions on Information Theory. [Online]. Available: http://arxiv.org/abs/1206.5365
14. 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.
15. K. Mahdaviani, R. Yazdani, and M. Ardakani, "Linear-complexity overhead-optimized random linear network codes." [Online]. Available: http://arxiv.org/abs/1311.2123
16. A. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2551-2567, Jun. 2006.
17. T. Richardsan and R. Urbanke, Modern Coding Theory. Cambridge University Press, Cambridge, England, 2008.
18. M. Luby, M. Mitzenmacher, M. Shokrollahi, and D. Spielman, "Improved low-density parity-check codes using irregular graphs," Information Theory, IEEE Transactions on, vol. 47, no. 2, pp. 585-598, Feb 2001.
19. T. J. Richardson and R. L. Urbanke, "Efficient encoding of low-density parity-check codes," Information Theory, IEEE Transactions on, vol. 47, no. 2, pp. 638-656, 2001.