{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:28:24Z","timestamp":1778603304602,"version":"3.51.4"},"reference-count":33,"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":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T00:00:00Z","timestamp":1450828800000},"content-version":"vor","delay-in-days":22,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1453121"],"award-info":[{"award-number":["1453121"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"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-0292-0","type":"journal-article","created":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T14:05:03Z","timestamp":1450879503000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["Cooperative local repair in distributed storage"],"prefix":"10.1186","volume":"2015","author":[{"given":"Ankit Singh","family":"Rawat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arya","family":"Mazumdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sriram","family":"Vishwanath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,23]]},"reference":[{"issue":"9","key":"292_CR1","doi-asserted-by":"publisher","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","volume":"56","author":"AG Dimakis","year":"2010","unstructured":"AG Dimakis, P Godfrey, Y Wu, M Wainwright, K Ramchandran, Network coding for distributed storage systems. IEEE Trans. Inf. Theory. 56(9), 4539\u20134551 (2010). doi: 10.1109\/TIT.2010.2054295 .","journal-title":"IEEE Trans. Inf. Theory"},{"key":"292_CR2","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","volume":"57","author":"K Rashmi","year":"2011","unstructured":"K Rashmi, N Shah, P Kumar, Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction. IEEE Trans. Inf. Theory. 57:, 5227\u20135239 (2011). doi: 10.1109\/TIT.2011.2159049 .","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"292_CR3","doi-asserted-by":"publisher","first-page":"1597","DOI":"10.1109\/TIT.2012.2227110","volume":"59","author":"I Tamo","year":"2013","unstructured":"I Tamo, Z Wang, J Bruck, Zigzag codes: MDS array codes with optimal rebuilding. IEEE Trans. Inf. Theory. 59(3), 1597\u20131616 (2013). doi: 10.1109\/TIT.2012.2227110 .","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"292_CR4","doi-asserted-by":"publisher","first-page":"3021","DOI":"10.1109\/TIT.2013.2241819","volume":"59","author":"DS Papailiopoulos","year":"2013","unstructured":"DS Papailiopoulos, AG Dimakis, V Cadambe, Repair optimal erasure codes through Hadamard designs. IEEE Trans. Inf. Theory. 59(5), 3021\u20133037 (2013). doi: 10.1109\/TIT.2013.2241819 .","journal-title":"IEEE Trans. Inf. Theory"},{"key":"292_CR5","volume-title":"Proceedings of the 3rd USENIX Conference on Hot Topics in Storage and File Systems. HotStorage\u201911","author":"O Khan","year":"2011","unstructured":"O Khan, R Burns, J Park, C Huang, in Proceedings of the 3rd USENIX Conference on Hot Topics in Storage and File Systems. HotStorage\u201911. In search of I\/O-optimal recovery from disk failures (USENIX AssociationBerkeley, CA, USA, 2011). http:\/\/dl.acm.org\/citation.cfm?id=2002218.2002224 ."},{"issue":"11","key":"292_CR6","doi-asserted-by":"publisher","first-page":"6925","DOI":"10.1109\/TIT.2012.2208937","volume":"58","author":"P Gopalan","year":"2012","unstructured":"P Gopalan, C Huang, H Simitci, S Yekhanin, On the locality of codeword symbols. IEEE Trans. Inf. Theory. 58(11), 6925\u20136934 (2012). doi: 10.1109\/TIT.2012.2208937 .","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"292_CR7","doi-asserted-by":"publisher","first-page":"5843","DOI":"10.1109\/TIT.2014.2325570","volume":"60","author":"DS Papailiopoulos","year":"2014","unstructured":"DS Papailiopoulos, AG Dimakis, Locally Repairable Codes. IEEE Trans. Inf. Theory. 60(10), 5843\u20135855 (2014). doi: 10.1109\/TIT.2014.2325570 .","journal-title":"IEEE Trans. Inf. Theory"},{"key":"292_CR8","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1109\/INFCOM.2011.5934901","volume-title":"Proceedings 2011 IEEE INFOCOM","author":"F Oggier","year":"2011","unstructured":"F Oggier, A Datta, in Proceedings 2011 IEEE INFOCOM. Self-repairing homomorphic codes for distributed storage systems (IEEE PressPiscataway, NJ, USA, 2011), pp. 1215\u20131223. doi: 10.1109\/INFCOM.2011.5934901 ."},{"issue":"1","key":"292_CR9","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1109\/TIT.2013.2288784","volume":"60","author":"AS Rawat","year":"2014","unstructured":"AS Rawat, OO Koyluoglu, N Silberstein, S Vishwanath, Optimal locally repairable and secure codes for distributed storage systems. IEEE Trans. Inf. Theory. 60(1), 212\u2013236 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"292_CR10","doi-asserted-by":"publisher","first-page":"4637","DOI":"10.1109\/TIT.2014.2329872","volume":"60","author":"GM Kamath","year":"2014","unstructured":"GM Kamath, N Prakash, V Lalitha, PV Kumar, Codes with local regeneration and erasure correction. IEEE Trans. Inf. Theory. 60(8), 4637\u20134660 (2014). doi: 10.1109\/TIT.2014.2329872 .","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"292_CR11","doi-asserted-by":"publisher","first-page":"4661","DOI":"10.1109\/TIT.2014.2321280","volume":"60","author":"I Tamo","year":"2014","unstructured":"I Tamo, A Barg, A family of optimal locally recoverable codes. IEEE Trans. Inf. Theory. 60(8), 4661\u20134676 (2014). doi: 10.1109\/TIT.2014.2321280 .","journal-title":"IEEE Trans. Inf. Theory"},{"key":"292_CR12","volume-title":"Proceedings of the 9th USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"D Ford","year":"2010","unstructured":"D Ford, F Labelle, F Popovici, M Stokely, V-A Truong, L Barroso, C Grimes, S Quinlan, in Proceedings of the 9th USENIX Symposium on Operating Systems Design and Implementation (OSDI). Availability in globally distributed storage systems (USENIXBerkeley, CA, 2010)."},{"key":"292_CR13","volume-title":"Proc. International Symposium on Network Coding","author":"AM Kermarrec","year":"2011","unstructured":"AM Kermarrec, NL Scouarnec, G Straub, in Proc. International Symposium on Network Coding. Repairing multiple failures with coordinated and adaptive regenerating codes (IEEE PressPiscataway, NJ, USA, 2011)."},{"issue":"11","key":"292_CR14","doi-asserted-by":"publisher","first-page":"7229","DOI":"10.1109\/TIT.2013.2274265","volume":"59","author":"KW Shum","year":"2013","unstructured":"KW Shum, Y Hu, Cooperative regenerating codes. IEEE Trans. Inf. Theory. 59(11), 7229\u20137258 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"292_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1090\/S0273-0979-1995-00569-0","volume":"32","author":"F Lazebnik","year":"1995","unstructured":"F Lazebnik, VA Ustimenko, AJ Woldar, A new series of dense graphs of high girth. Bull. Am. Math. Soc.32(1), 73\u201379 (1995).","journal-title":"Bull. Am. Math. Soc."},{"key":"292_CR16","doi-asserted-by":"publisher","first-page":"2776","DOI":"10.1109\/ISIT.2012.6284028","volume-title":"Proc. 2012 IEEE International Symposium on Information Theory (ISIT)","author":"N Prakash","year":"2012","unstructured":"N Prakash, GM Kamath, V Lalitha, PV Kumar, in Proc. 2012 IEEE International Symposium on Information Theory (ISIT). Optimal linear codes with a local-error-correction property (IEEE PressPiscataway, NJ, USA, 2012), pp. 2776\u20132780. doi: 10.1109\/ISIT.2012.6284028 ."},{"key":"292_CR17","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1109\/ISIT.2013.6620355","volume-title":"Proc. 2013 IEEE International Symposium on Information Theory (ISIT)","author":"L Pamies-Juarez","year":"2013","unstructured":"L Pamies-Juarez, HDL Hollmann, F Oggier, in Proc. 2013 IEEE International Symposium on Information Theory (ISIT). Locally repairable codes with multiple repair alternatives (IEEE PressPiscataway, NJ, USA, 2013), pp. 892\u2013896. doi: 10.1109\/ISIT.2013.6620355 ."},{"key":"292_CR18","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1109\/ISIT.2014.6874921","volume-title":"Proc. 2014 IEEE International Symposium on Information Theory (ISIT)","author":"I Tamo","year":"2014","unstructured":"I Tamo, A Barg, in Proc. 2014 IEEE International Symposium on Information Theory (ISIT). Bounds on locally recoverable codes with multiple recovering sets (IEEE PressPiscataway, NJ, USA, 2014), pp. 691\u2013695. doi: 10.1109\/ISIT.2014.6874921 ."},{"issue":"11","key":"292_CR19","doi-asserted-by":"publisher","first-page":"6979","DOI":"10.1109\/TIT.2014.2351404","volume":"60","author":"A Wang","year":"2014","unstructured":"A Wang, Z Zhang, Repair locality with multiple erasure tolerance. IEEE Trans. Inf. Theory. 60(11), 6979\u20136987 (2014). doi: 10.1109\/TIT.2014.2351404 .","journal-title":"IEEE Trans. Inf. Theory"},{"key":"292_CR20","first-page":"681","volume-title":"Proceedings of the IEEE International Symposium on Information Theory (ISIT)","author":"AS Rawat","year":"2014","unstructured":"AS Rawat, DS Papailiopoulos, AG Dimakis, S Vishwanath, in Proceedings of the IEEE International Symposium on Information Theory (ISIT). Locality and availability in distributed storage (IEEE PressPiscataway, NJ, USA, 2014), pp. 681\u2013685."},{"key":"292_CR21","doi-asserted-by":"publisher","first-page":"2801","DOI":"10.1109\/INFCOM.2012.6195703","volume-title":"Proceedings 2012 IEEE INFOCOM","author":"DS Papailiopoulos","year":"2012","unstructured":"DS Papailiopoulos, J Luo, AG Dimakis, C Huang, J Li, in Proceedings 2012 IEEE INFOCOM. Simple regenerating codes: network coding for cloud storage (IEEE PressPiscataway, NJ, USA, 2012), pp. 2801\u20132805. doi: 10.1109\/INFCOM.2012.6195703 ."},{"key":"292_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/NetCod.2013.6570829","volume-title":"2013 International Symposium on Network Coding (NetCod)","author":"V Cadambe","year":"2013","unstructured":"V Cadambe, A Mazumdar, in 2013 International Symposium on Network Coding (NetCod). An upper bound on the size of locally recoverable codes (IEEE PressPiscataway, NJ, USA, 2013), pp. 1\u20135. doi: 10.1109\/NetCod.2013.6570829 ."},{"key":"292_CR23","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.disc.2014.01.016","volume":"324","author":"M Forbes","year":"2014","unstructured":"M Forbes, S Yekhanin, On the locality of codeword symbols in non-linear codes. Discrete Math. 324:, 7 (2014). 10.1016\/j.disc.2014.01.016 , http:\/\/dx.doi.org\/10.1016\/j.disc.2014.01.016 .","journal-title":"Discrete Math"},{"key":"292_CR24","doi-asserted-by":"publisher","first-page":"1962","DOI":"10.1109\/ISIT.2014.6875176","volume-title":"Proc. 2014 IEEE International Symposium on Information Theory (ISIT)","author":"N Prakash","year":"2014","unstructured":"N Prakash, V Lalitha, PV Kumar, in Proc. 2014 IEEE International Symposium on Information Theory (ISIT). Codes with locality for two erasures (IEEE PressPiscataway, NJ, USA, 2014), pp. 1962\u20131966. doi: 10.1109\/ISIT.2014.6875176 ."},{"issue":"1\u20133","key":"292_CR25","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0166-218X(94)00058-L","volume":"60","author":"F Lazebnik","year":"1995","unstructured":"F Lazebnik, VA Ustimenko, Explicit construction of graphs with an arbitrary large girth and of large size. Discret. Appl. Math.60(1\u20133), 275\u2013284 (1995).","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"292_CR26","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"R Tanner","year":"1981","unstructured":"R Tanner, A recursive approach to low complexity codes. IEEE Trans. Inf. Theor.27(5), 533\u2013547 (1981). doi: 10.1109\/TIT.1981.1056404 .","journal-title":"IEEE Trans. Inf. Theor."},{"key":"292_CR27","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/ISIT.2002.1023274","volume-title":"Proc. 2002 IEEE International Symposium on Information Theory (ISIT)","author":"A Orlitsky","year":"2002","unstructured":"A Orlitsky, R Urbanke, K Viswanathan, J Zhang, in Proc. 2002 IEEE International Symposium on Information Theory (ISIT). Stopping sets and the girth of tanner graphs (IEEE PressPiscataway, NJ, USA, 2002), pp. 2\u20132."},{"issue":"6","key":"292_CR28","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M Sipser","year":"1996","unstructured":"M Sipser, DA Spielman, Expander codes. IEEE Trans. Inf. Theory. 42(6), 1710\u20131722 (1996). doi: 10.1109\/18.556667 .","journal-title":"IEEE Trans. Inf. Theory"},{"key":"292_CR29","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1145\/509907.510003","volume-title":"Proceedings of the Thiry-fourth Annual ACM Symposium on Theory of Computing. STOC \u201902","author":"M Capalbo","year":"2002","unstructured":"M Capalbo, O Reingold, S Vadhan, A Wigderson, in Proceedings of the Thiry-fourth Annual ACM Symposium on Theory of Computing. STOC \u201902. Randomness conductors and constant-degree lossless expanders (ACMNew York, NY, USA, 2002), pp. 659\u2013668. doi: 10.1145\/509907.510003 . http:\/\/doi.acm.org\/10.1145\/509907.510003."},{"issue":"2","key":"292_CR30","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1109\/18.910593","volume":"47","author":"G Zemor","year":"2001","unstructured":"G Zemor, On expander codes. IEEE Trans. Inf. Theory. 47(2), 835\u2013837 (2001). doi: 10.1109\/18.910593 .","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1-3","key":"292_CR31","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0012-365X(88)90189-6","volume":"72","author":"N Alon","year":"1988","unstructured":"N Alon, FRK Chung, Explicit construction of linear sized tolerant networks. Discrete Math.72(1-3), 15\u201319 (1988). doi: 10.1016\/0012-365X(88)90189-6 .","journal-title":"Discrete Math."},{"key":"292_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14358-8","volume-title":"Locally Decodable Codes and Private Information Retrieval Schemes","author":"S Yekhanin","year":"2010","unstructured":"S Yekhanin, Locally Decodable Codes and Private Information Retrieval Schemes (Springer, New York, USA, 2010). doi: 10.1007\/978-3-642-14358-8 ."},{"key":"292_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/ITA.2013.6502958","volume-title":"Proc. 2013 Information Theory and Applications Workshop (ITA)","author":"A Mazumdar","year":"2013","unstructured":"A Mazumdar, V Chandar, GW Wornell, in Proc. 2013 Information Theory and Applications Workshop (ITA). Local recovery properties of capacity achieving codes (IEEE PressPiscataway, NJ, USA, 2013), pp. 1\u20133. doi: 10.1109\/ITA.2013.6502958 ."}],"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-0292-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13634-015-0292-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-015-0292-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-015-0292-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T08:11:39Z","timestamp":1692173499000},"score":1,"resource":{"primary":{"URL":"https:\/\/asp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13634-015-0292-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["292"],"URL":"https:\/\/doi.org\/10.1186\/s13634-015-0292-0","relation":{},"ISSN":["1687-6180"],"issn-type":[{"value":"1687-6180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12]]},"assertion":[{"value":"3 July 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"107"}}