Expander graph based overlapped chunked codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 2451-2455

  Tang, Bin ^a   Yang, Shenghao ^b   Yin, Yitong ^a   Ye, Baoliu ^a   Lu, Sanglu ^a  

^a NANJING UNIVERSITY   (China)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS AND DESIGN; COMPUTATIONAL CONSTRAINTS; CONSTANT RATE; EXPANDER GRAPHS; INCREASING FUNCTIONS; LINEAR ENCODING; LOW COMPUTATIONAL COMPLEXITY; MIN-CUT; NETWORK DEVICES; PRECODING; REAL APPLICATIONS;

INFORMATION THEORY;

EID: 84867546356     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6283956     Document Type: Conference Paper

References (24)

1. T. Ho, R. Koetter, M. Médard, D. R. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. ISIT, 2003.
2. T. Ho, M. Médard, R. Koetter, D. R. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast," IEEE Trans. Inform. Theory, 52(10), pp. 4413-4430, 2006.
3. Y. Wu, "A trellis connectivity analysis of random linear network coding with buffering," in Proc. ISIT, 2006.
4. D. S. Lun, M. Médard, R. Koetter, and M. Effros, "On coding for reliable communication over packet networks," Physical Communication, 1(1), pp. 3-20, 2008.
5. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. Allerton Conf. Comm., Control, and Computing, 2003.
6. Y. Lin, B. Li, and B. Liang, "CodeOR: opportunistic routing in wireless mesh networks with segmented network coding," in Proc. ICNP, 2008.
7. D. Koutsonikolas, C.-C. Wang, and Y. C. Hu, "Efficient network-coding-based opportunistic routing through cumulative coded acknowledgments, " IEEE/ACM Trans. Netw., 19(5), pp. 1368-1381, 2011.
8. P. Maymounkov, N.J.A. Harvey, and D.S. Lun, "Methods for efficient network coding," in Proc. Allerton Conf. Comm., Control, and Computing, 2006.
9. A. Heidarzadeh and A.H. Banihashemi, "Overlapped chunked network coding," in Proc. ITW, 2010.
10. D. Silva, W. Zeng, and F.R. Kschischang, "Sparse network coding with overlapping classes, "in Proc. NetCod, 2009.
11. Y. Li, E. Soljanin, and P. Spasojević, "Effects of the generation size and overlap on throughput and complexity in randomized linear network coding, " IEEE Trans. Inform. Theory, 57(2), pp. 1111-1123, 2011.
12. A. Heidarzadeh and A.H. Banihashemi, "Analysis of overlapped chunked codes with small chunks over line networks," in Proc. ISIT, 2011.
13. A. Heidarzadeh and A.H. Banihashemi, "Network codes with overlapping chunks over line networks: a case for linear-time codes," 2011. [Online]. Available: http://arxiv.org/abs/1105.5736
14. A. Shokrollahi, "Raptor codes," IEEE Trans. Inform. Theory, 52(6), pp. 2551-2567, 2006.
15. L. Flatto, "Limit theorems for some random variables associated with urn models," Ann. Probabil., 10(4), pp. 927-934, 1982.
16. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inform. Theory, 47(2), pp. 569-584, 2001.
17. P. Oswald, and A.Shokrollahi, "Capacity-achieving sequences for the erasure channel," IEEE Trans. Inform. Theory, 48(12), pp. 3017-3028, 2002.
18. S. Yang, S.-W. Ho, J. Meng, E. Yang, and R. W. Yeung, "On linear operator channels over finite fields," 2009. [Online]. Available: http://arxiv.org/abs/1002.2293
19. M. Mitzenmacher, and E. Upfal, "Probablity and computing: randomized algorithms and probabilistic analysis," Cambridge University Press, 2005.
20. N. C. Wormald, "Models of random regular graphs," Surverys in Combinatorics, pp. 239-298, 1999.
21. I. Dumitriu, and S. Pal, "Sparse regular random graphs: spectral density and eigenvalues," Preprint, 2011.
22. N. Alon, and F. R. K. Chung, "Explicit construction of linear sized tolerant networks," Discrete Mathemat., 72, pp. 15-19, 1988.
23. A. Nilli, "On the second eigenvalue of a graph," Discrete Mathemat., 91(2), pp. 207-210, 1991.
24. J. Friedman, "A proof of Alon's second eigenvalue conjecture," in Proc. STOC, 2003.