Expander chunked codes

Eurasip Journal on Advances in Signal Processing

Volumn 2015, Issue 1, 2015, Pages 1-13

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

^a NANJING UNIVERSITY   (China)

^b THE CHINESE UNIVERSITY OF HONG KONG   (China)

Author keywords

Chunked codes; Iterative decoding; Random linear network coding; Random regular graph

Indexed keywords

CODES (SYMBOLS); GRAPH THEORY; ITERATIVE DECODING; LINEAR NETWORKS; TRANSFER MATRIX METHOD;

CHUNKED CODES; COMPUTATIONAL COSTS; DISJOINT SUBSETS; NETWORK TRANSMISSION; PERFORMANCE ANALYSIS; RANDOM LINEAR NETWORK CODING; RANDOM REGULAR GRAPH; TRANSFER MATRIX MODEL;

NETWORK CODING;

EID: 84951837178     PISSN: 16876172     EISSN: 16876180     Source Type: Journal    
DOI: 10.1186/s13634-015-0297-8     Document Type: Article

References (41)

1. R Ahlswede, N Cai, S-YR Li, RW Yeung, Network information flow. IEEE Trans. Inf. Theory. 46(4), 1204–1216 (2000).
2. S-YR Li, RW Yeung, N Cai, Linear network coding. IEEE Trans. Inf. Theory. 49(2), 371–381 (2003).
3. T Ho, R Koetter, M Medard, DR Karger, M Effros, in Proc. IEEE International Symposium on Information Theory. The benefits of coding over routing in a randomized setting, (2003), p. 442.
4. T Ho, M Medard, R Koetter, DR Karger, M Effros, J Shi, B Leong, A random linear network coding approach to multicast. IEEE Trans. Inf. Theory. 52(10), 4413–4430 (2006).
5. Y Wu, in Proc. International Symposium on Information Theory. A trellis connectivity analysis of random linear network coding with buffering, (2006), pp. 768–772.
6. AF Dana, R Gowaikar, R Palanki, B Hassibi, M Effros, Capacity of wireless erasure networks. IEEE Trans. Inf. Theory. 52(3), 789–804 (2006). doi:10.1109/TIT.2005.864424.
7. DS Lun, M Medard, R Koetter, M Effros, On coding for reliable communication over packet networks. Phys. Commun. 1(1), 3–20 (2008).
8. PA Chou, Y Wu, K Jain, in Proc. 41st Allerton Conference on Communication, Control, and Computing. Practical network coding, (2003), pp. 40–49.
9. Z Liu, C Wu, B Li, S Zhao, in Proc. IEEE International Conference on Computer Communications. UUSee: Large-scale operational on-demand streaming with random network coding, (2010), pp. 1–9.
10. D Silva, W Zeng, FR Kschischang, in Proc. Workshop on Network Coding. Sparse network coding with overlapping classes, (2009), pp. 74–79.
11. A Heidarzadeh, AH Banihashemi, in Proc. IEEE Information Theory Workshop. Overlapped chunked network coding, (2010), pp. 1–5.
12. Y Li, E Soljanin, P Spasojevic, Effects of the generation size and overlap on throughput and complexity in randomized linear network coding. IEEE Trans. Inf. Theory. 57(2), 1111–1123 (2011).
13. S Yang, RW Yeung, in Proc. IEEE International Symposium on Information Theory. Coding for a network coded fountain (Saint Petersburg, Russia, 2011), pp. 2647–2651.
14. S Yang, RW Yeung, Batched sparse codes. IEEE Trans. Inf. Theory. 60(9), 5322–5346 (2014).
15. K Mahdaviani, M Ardakani, H Bagheri, C Tellambura, in Proc. International Symposium on Network Coding. Gamma codes: a low-overhead linear-complexity network coding solution, (2012), pp. 125–130.
16. K Mahdaviani, R Yazdani, M Ardakani, in Proc. International Symposium on Network Coding. Overhead-optimized gamma network codes,(2013), poster.
17. S Yang, B Tang, in Proc. IEEE Information Theory Workshop. From LDPC to chunked network codes, (2014), pp. 406–410.
18. B Tang, S Yang, B Ye, S Lu, S Guo, Near-optimal one-sided scheduling for coded segmented network coding. IEEE Trans. Comput. (2015), to appear.
19. P Pakzad, C Fragouli, A Shokrollahi, in Proc. IEEE International Symposium on Information Theory. Coding schemes for line networks, (2005), pp. 1853–1857. doi:10.1109/ISIT.2005.1523666.
20. U Niesen, C Fragouli, D Tuninetti, On capacity of line networks. IEEE Trans. Inf. Theory. 53(11), 4039–4058 (2007).
21. BN Vellambi, N Torabkhani, F Fekri, Throughput and latency in finite-buffer line networks. IEEE Trans. Inf. Theory. 57(6), 3622–3643 (2011). doi:10.1109/TIT.2011.2137070.
22. Q Huang, K Sun, X Li, D Wu, in Proc. ACM International Symposium on Mobile Ad Hoc Networking and Computing. Just fun: a joint fountain coding and network coding approach to loss-tolerant information spreading (Philadelphia, PA, USA, 2014), pp. 83–92.
23. X Xu, PKM Gandhi, YL Guan, PHJ Chong, Two-phase cooperative broadcasting based on batched network code. arXiv preprint arXiv:1504.04464, (2015). http://arxiv.org/abs/1504.04464.
24. S Chachulski, M Jennings, S Katti, D Katabi, Trading structure for randomness in wireless opportunistic routing. SIGCOMM Comput. Commun. Rev. 37(4), 169–180 (2007).
25. Y Lin, B Li, B Liang, in Proc. IEEE International Conference on Network Protocols. CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding, (2008), pp. 13–22.
26. D Koutsonikolas, C-C Wang, YC Hu, Efficient network-coding-based opportunistic routing through cumulative coded acknowledgments. IEEE/ACM Trans. Netw. 19(5), 1368–1381 (2011).
27. P Maymounkov, NJA Harvey, DS Lun, in Proc. 44th Allerton Conference on Communication, Control, and Computing. Methods for efficient network coding, (2006).
28. M Luby, in Proc. 43rd Annual IEEE Symposium on Foundations of Computer Science. LT codes, (2002), pp. 271–282.
29. A Shokrollahi, Raptor codes. IEEE Trans. Inf. Theory. 52(6), 2551–2567 (2006).
30. K Mahdaviani, R Yazdani, M Ardakani, Linear-complexity overhead-optimized random linear network codes. arXiv preprint arXiv:1311.2123 (2013). http://arxiv.org/abs/1311.2123.
31. B Tang, S Yang, Y Yin, B Ye, S Lu, in Proc. IEEE International Symposium on Information Theory. Expander graph based overlapped chunked codes (Cambridge, MA, USA, 2012), pp. 2451–2455.
32. S Yang, RW Yeung, HF Cheung, HHF Yin, in Proc. 52nd Allerton Conference on Communication, Control, and Computing. BATS: Network coding in action, (2014), pp. 1204–1211.
33. GE Andrews, The Theory of Partitions vol. 2 (Cambridge University Press, New York, NY, USA, 1998).
34. M Gadouleau, Z Yan, Packing and covering properties of subspace codes for error control in random linear network coding. IEEE Trans. Inf. Theory. 56(5), 2097–2108 (2010).
35. L Shi, N Wormald, in Surveys in combinatorics. Models of random regular graphs (LMS Lecture Note Series 267, 1999), pp. 239–298.
36. BD McKay, NC Wormald, B Wysocka, Short cycles in random regular graphs. Electron. J. Comb. 11(1), 1–12 (2004).
37. M Mitzenmacher, E Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis (Cambridge University Press, New York, NY, USA, 2004).
38. BD McKay, NC Wormald, Uniform generation of random regular graphs of moderate degree. J. Algoritm. 11(1), 52–67 (1990).
39. G Margulis, Explicit construction of concentrators. Probl. Peredachi Inf. 9(4), 325–332 (1973).
40. S Hoory, N Linial, A Wigderson, Expander graphs and their applications. Bull. Amer. Math. Soc. 43(4), 439–561 (2006).
41. NA Smith, RW Tromble, Sampling uniformly from the unit simplex. http://www.cs.cmu.edu/~nasmith/papers/smith+tromble.tr04.pdf.