{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T06:35:49Z","timestamp":1724135749984},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURASIP J. Adv. Signal Process."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1186\/s13634-015-0297-8","type":"journal-article","created":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T23:49:44Z","timestamp":1450741784000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Expander chunked codes"],"prefix":"10.1186","volume":"2015","author":[{"given":"Bin","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shenghao","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baoliu","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yitong","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanglu","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,22]]},"reference":[{"issue":"4","key":"297_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"R Ahlswede, N Cai, S-YR Li, RW Yeung, Network information flow. IEEE Trans. Inf. Theory. 46(4), 1204\u20131216 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"297_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"S-YR Li","year":"2003","unstructured":"S-YR Li, RW Yeung, N Cai, Linear network coding. IEEE Trans. Inf. Theory. 49(2), 371\u2013381 (2003).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"297_CR3","unstructured":"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."},{"issue":"10","key":"297_CR4","doi-asserted-by":"publisher","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","volume":"52","author":"T Ho","year":"2006","unstructured":"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\u20134430 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"297_CR5","unstructured":"Y Wu, in Proc. International Symposium on Information Theory. A trellis connectivity analysis of random linear network coding with buffering, (2006), pp. 768\u2013772."},{"issue":"3","key":"297_CR6","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1109\/TIT.2005.864424","volume":"52","author":"AF Dana","year":"2006","unstructured":"AF Dana, R Gowaikar, R Palanki, B Hassibi, M Effros, Capacity of wireless erasure networks. IEEE Trans. Inf. Theory. 52(3), 789\u2013804 (2006). doi: 10.1109\/TIT.2005.864424 .","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"297_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.phycom.2008.01.006","volume":"1","author":"DS Lun","year":"2008","unstructured":"DS Lun, M Medard, R Koetter, M Effros, On coding for reliable communication over packet networks. Phys. Commun. 1(1), 3\u201320 (2008).","journal-title":"Phys. Commun"},{"key":"297_CR8","unstructured":"PA Chou, Y Wu, K Jain, in Proc. 41st Allerton Conference on Communication, Control, and Computing. Practical network coding, (2003), pp. 40\u201349."},{"key":"297_CR9","unstructured":"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\u20139."},{"key":"297_CR10","unstructured":"D Silva, W Zeng, FR Kschischang, in Proc. Workshop on Network Coding. Sparse network coding with overlapping classes, (2009), pp. 74\u201379."},{"key":"297_CR11","unstructured":"A Heidarzadeh, AH Banihashemi, in Proc. IEEE Information Theory Workshop. Overlapped chunked network coding, (2010), pp. 1\u20135."},{"issue":"2","key":"297_CR12","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1109\/TIT.2010.2095111","volume":"57","author":"Y Li","year":"2011","unstructured":"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\u20131123 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"297_CR13","doi-asserted-by":"crossref","unstructured":"S Yang, RW Yeung, in Proc. IEEE International Symposium on Information Theory. Coding for a network coded fountain (Saint Petersburg, Russia, 2011), pp. 2647\u20132651.","DOI":"10.1109\/ISIT.2011.6034050"},{"issue":"9","key":"297_CR14","doi-asserted-by":"publisher","first-page":"5322","DOI":"10.1109\/TIT.2014.2334315","volume":"60","author":"S Yang","year":"2014","unstructured":"S Yang, RW Yeung, Batched sparse codes. IEEE Trans. Inf. Theory. 60(9), 5322\u20135346 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"297_CR15","unstructured":"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\u2013130."},{"key":"297_CR16","unstructured":"K Mahdaviani, R Yazdani, M Ardakani, in Proc. International Symposium on Network Coding. Overhead-optimized gamma network codes,(2013), poster."},{"key":"297_CR17","unstructured":"S Yang, B Tang, in Proc. IEEE Information Theory Workshop. From LDPC to chunked network codes, (2014), pp. 406\u2013410."},{"key":"297_CR18","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/TC.2015.2435792"},{"key":"297_CR19","doi-asserted-by":"crossref","unstructured":"P Pakzad, C Fragouli, A Shokrollahi, in Proc. IEEE International Symposium on Information Theory. Coding schemes for line networks, (2005), pp. 1853\u20131857. doi: 10.1109\/ISIT.2005.1523666 .","DOI":"10.1109\/ISIT.2005.1523666"},{"issue":"11","key":"297_CR20","doi-asserted-by":"publisher","first-page":"4039","DOI":"10.1109\/TIT.2007.907513","volume":"53","author":"U Niesen","year":"2007","unstructured":"U Niesen, C Fragouli, D Tuninetti, On capacity of line networks. IEEE Trans. Inf. Theory. 53(11), 4039\u20134058 (2007).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"297_CR21","doi-asserted-by":"publisher","first-page":"3622","DOI":"10.1109\/TIT.2011.2137070","volume":"57","author":"BN Vellambi","year":"2011","unstructured":"BN Vellambi, N Torabkhani, F Fekri, Throughput and latency in finite-buffer line networks. IEEE Trans. Inf. Theory. 57(6), 3622\u20133643 (2011). doi: 10.1109\/TIT.2011.2137070 .","journal-title":"IEEE Trans. Inf. Theory"},{"key":"297_CR22","doi-asserted-by":"crossref","unstructured":"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\u201392.","DOI":"10.1145\/2632951.2632965"},{"key":"297_CR23","unstructured":"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 ."},{"issue":"4","key":"297_CR24","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1145\/1282427.1282400","volume":"37","author":"S Chachulski","year":"2007","unstructured":"S Chachulski, M Jennings, S Katti, D Katabi, Trading structure for randomness in wireless opportunistic routing. SIGCOMM Comput. Commun. Rev. 37(4), 169\u2013180 (2007).","journal-title":"SIGCOMM Comput. Commun. Rev"},{"key":"297_CR25","unstructured":"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\u201322."},{"issue":"5","key":"297_CR26","doi-asserted-by":"publisher","first-page":"1368","DOI":"10.1109\/TNET.2011.2111382","volume":"19","author":"D Koutsonikolas","year":"2011","unstructured":"D Koutsonikolas, C-C Wang, YC Hu, Efficient network-coding-based opportunistic routing through cumulative coded acknowledgments. IEEE\/ACM Trans. Netw. 19(5), 1368\u20131381 (2011).","journal-title":"IEEE\/ACM Trans. Netw"},{"key":"297_CR27","unstructured":"P Maymounkov, NJA Harvey, DS Lun, in Proc. 44th Allerton Conference on Communication, Control, and Computing. Methods for efficient network coding, (2006)."},{"key":"297_CR28","unstructured":"M Luby, in Proc. 43rd Annual IEEE Symposium on Foundations of Computer Science. LT codes, (2002), pp. 271\u2013282."},{"issue":"6","key":"297_CR29","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1109\/TIT.2006.874390","volume":"52","author":"A Shokrollahi","year":"2006","unstructured":"A Shokrollahi, Raptor codes. IEEE Trans. Inf. Theory. 52(6), 2551\u20132567 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"297_CR30","unstructured":"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 ."},{"key":"297_CR31","doi-asserted-by":"crossref","unstructured":"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\u20132455.","DOI":"10.1109\/ISIT.2012.6283956"},{"key":"297_CR32","unstructured":"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\u20131211."},{"key":"297_CR33","volume-title":"The Theory of Partitions vol. 2","author":"GE Andrews","year":"1998","unstructured":"GE Andrews, The Theory of Partitions vol. 2 (Cambridge University Press, New York, NY, USA, 1998)."},{"issue":"5","key":"297_CR34","doi-asserted-by":"publisher","first-page":"2097","DOI":"10.1109\/TIT.2010.2043780","volume":"56","author":"M Gadouleau","year":"2010","unstructured":"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\u20132108 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"297_CR35","doi-asserted-by":"crossref","unstructured":"L Shi, N Wormald, in Surveys in combinatorics. Models of random regular graphs (LMS Lecture Note Series 267, 1999), pp. 239\u2013298.","DOI":"10.1017\/CBO9780511721335.010"},{"issue":"1","key":"297_CR36","first-page":"1","volume":"11","author":"BD McKay","year":"2004","unstructured":"BD McKay, NC Wormald, B Wysocka, Short cycles in random regular graphs. Electron. J. Comb.11(1), 1\u201312 (2004).","journal-title":"Electron. J. Comb."},{"key":"297_CR37","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2004","unstructured":"M Mitzenmacher, E Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis (Cambridge University Press, New York, NY, USA, 2004)."},{"issue":"1","key":"297_CR38","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/0196-6774(90)90029-E","volume":"11","author":"BD McKay","year":"1990","unstructured":"BD McKay, NC Wormald, Uniform generation of random regular graphs of moderate degree. J. Algoritm. 11(1), 52\u201367 (1990).","journal-title":"J. Algoritm"},{"issue":"4","key":"297_CR39","first-page":"325","volume":"9","author":"G Margulis","year":"1973","unstructured":"G Margulis, Explicit construction of concentrators. Probl. Peredachi Inf.9(4), 325\u2013332 (1973).","journal-title":"Probl. Peredachi Inf."},{"issue":"4","key":"297_CR40","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S Hoory","year":"2006","unstructured":"S Hoory, N Linial, A Wigderson, Expander graphs and their applications. Bull. Amer. Math. Soc. 43(4), 439\u2013561 (2006).","journal-title":"Bull. Amer. Math. Soc"},{"key":"297_CR41","unstructured":"NA Smith, RW Tromble, Sampling uniformly from the unit simplex. http:\/\/www.cs.cmu.edu\/~nasmith\/papers\/smith+tromble.tr04.pdf ."}],"container-title":["EURASIP Journal on Advances in Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-015-0297-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13634-015-0297-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-015-0297-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-015-0297-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T16:30:58Z","timestamp":1567441858000},"score":1,"resource":{"primary":{"URL":"https:\/\/asp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13634-015-0297-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["297"],"URL":"https:\/\/doi.org\/10.1186\/s13634-015-0297-8","relation":{},"ISSN":["1687-6180"],"issn-type":[{"value":"1687-6180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12]]},"article-number":"106"}}