{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T05:54:41Z","timestamp":1791352481834,"version":"4.3.1"},"reference-count":186,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T00:00:00Z","timestamp":1536192000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s11432-018-9482-6","type":"journal-article","created":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T05:26:55Z","timestamp":1536816415000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":150,"title":["Erasure coding for distributed storage: an overview"],"prefix":"10.1007","volume":"61","author":[{"given":"S. B.","family":"Balaji","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M. Nikhil","family":"Krishnan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Myna","family":"Vajha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vinayak","family":"Ramkumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Birenjith","family":"Sasidharan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P. Vijay","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,9,6]]},"reference":[{"key":"9482_CR1","volume-title":"Proceedings of the 5th USENIX Workshop on Hot Topics in Storage and File Systems, San Jose","author":"V Rashmi","year":"2013","unstructured":"Rashmi V, Shah N B, Gu D, et al. A solution to the network challenges of data recovery in erasure-coded distributed storage systems: a study on the facebook warehouse cluster. In: Proceedings of the 5th USENIX Workshop on Hot Topics in Storage and File Systems, San Jose, 2013"},{"key":"9482_CR2","doi-asserted-by":"crossref","first-page":"325","DOI":"10.14778\/2535573.2488339","volume":"6","author":"M Sathiamoorthy","year":"2013","unstructured":"Sathiamoorthy M, Asteris M, Papailiopoulos D, et al. XORing elephants. Proc VLDB Endow, 2013, 6: 325\u2013336","journal-title":"Proc VLDB Endow"},{"key":"9482_CR3","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1109\/JPROC.2010.2096170","volume":"99","author":"G Dimakis","year":"2011","unstructured":"Dimakis G, Ramchandran K, Wu Y N, et al. A survey on network codes for distributed storage. Proc IEEE, 2011, 99: 476\u2013489","journal-title":"Proc IEEE"},{"key":"9482_CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/2447712.2447735","volume":"44","author":"A Datta","year":"2013","unstructured":"Datta A, Oggier F. An overview of codes tailor-made for better repairability in networked distributed storage systems. SIGACT News, 2013, 44: 89","journal-title":"SIGACT News"},{"key":"9482_CR5","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1109\/TST.2013.6522585","volume":"18","author":"J Li","year":"2013","unstructured":"Li J, Li B. Erasure coding for cloud storage systems: a survey. Tinshhua Sci Technol, 2013, 18: 259\u2013272","journal-title":"Tinshhua Sci Technol"},{"key":"9482_CR6","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/978-3-319-70293-3_14","volume-title":"Network Coding and Subspace Designs","author":"Q Liu","year":"2018","unstructured":"Liu Q, Oggier F. An overview of coding for distributed storage systems. In: Network Coding and Subspace Designs. Berlin: Springer, 2018. 363\u2013383"},{"key":"9482_CR7","doi-asserted-by":"crossref","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","volume":"56","author":"G Dimakis","year":"2010","unstructured":"Dimakis G, Godfrey P B, Wu Y, et al. Network coding for distributed storage systems. IEEE Trans Inf Theory, 2010, 56: 4539\u20134551","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1109\/JSAC.2010.100217","volume":"28","author":"Y Wu","year":"2010","unstructured":"Wu Y. Existence and construction of capacity-achieving network codes for distributed storage. IEEE J Sel Areas Commun, 2010, 28: 277\u2013288","journal-title":"IEEE J Sel Areas Commun"},{"key":"9482_CR9","doi-asserted-by":"crossref","first-page":"2134","DOI":"10.1109\/TIT.2011.2178588","volume":"58","author":"B Shah","year":"2012","unstructured":"Shah B, Rashmi K V, Kumar P V, et al. Interference alignment in regenerating codes for distributed storage: necessity and code constructions. IEEE Trans Inf Theory, 2012, 58: 2134\u20132158","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR10","volume-title":"Proceedings of the 10th USENIX Conference on File and Storage Technologies, San Jose","author":"C Hu","year":"2012","unstructured":"Hu C, Chen H C H, Lee P P C, et al. NCCloud: applying network coding for the storage repair in a cloud-of-clouds. In: Proceedings of the 10th USENIX Conference on File and Storage Technologies, San Jose, 2012"},{"key":"9482_CR11","first-page":"71","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Barcelona","author":"N Krishnan","year":"2016","unstructured":"Krishnan N, Kumar P V. On MBR codes with replication. In: Proceedings of IEEE International Symposium on Information Theory, Barcelona, 2016. 71\u201375"},{"key":"9482_CR12","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1109\/LCOMM.2013.040213.130006","volume":"17","author":"B Shah","year":"2013","unstructured":"Shah B. On minimizing data-read and download for storage-node recovery. IEEE Commun Lett, 2013, 17: 964\u2013967","journal-title":"IEEE Commun Lett"},{"key":"9482_CR13","first-page":"1243","volume-title":"Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing, Monticello","author":"V Rashmi","year":"2009","unstructured":"Rashmi V, Shah N B, Kumar P V, et al. Explicit construction of optimal exact regenerating codes for distributed storage. In: Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing, Monticello, 2009. 1243\u20131249"},{"key":"9482_CR14","doi-asserted-by":"crossref","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","volume":"57","author":"V Rashmi","year":"2011","unstructured":"Rashmi V, Shah N B, Kumar P V. Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction. IEEE Trans Inf Theory, 2011, 57: 5227\u20135239","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR15","doi-asserted-by":"crossref","first-page":"3232","DOI":"10.1109\/TPDS.2013.2297109","volume":"25","author":"J Lin","year":"2014","unstructured":"Lin J, Chung W H. Novel repair-by-transfer codes and systematic exact-mbr codes with lower complexities and smaller field sizes. IEEE Trans Parallel Distrib Syst, 2014, 25: 3232\u20133241","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"9482_CR16","doi-asserted-by":"crossref","first-page":"1925","DOI":"10.1109\/TCOMM.2015.2424416","volume":"63","author":"S Han","year":"2015","unstructured":"Han S, Pai H T, Zheng R, et al. Update-efficient error-correcting product-matrix codes. IEEE Trans Commun, 2015, 63: 1925\u20131938","journal-title":"IEEE Trans Commun"},{"key":"9482_CR17","first-page":"1416","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Aachen","author":"N Raviv","year":"2017","unstructured":"Raviv N. Asymptotically optimal regenerating codes over any field. In: Proceedings of IEEE International Symposium on Information Theory, Aachen, 2017. 1416\u20131420"},{"key":"9482_CR18","volume-title":"Bandwidth adaptive & error resilient MBR exact repair regenerating codes","author":"K Mahdaviani","year":"2017","unstructured":"Mahdaviani K, Khisti A, Mohajer S. Bandwidth adaptive & error resilient MBR exact repair regenerating codes. 2017. ArXiv:1711.02770"},{"key":"9482_CR19","first-page":"2276","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Seoul","author":"Y Wu","year":"2009","unstructured":"Wu Y, Dimakis G. Reducing repair traffic for erasure coding-based storage via interference alignment. In: Proceedings of IEEE International Symposium on Information Theory, Seoul, 2009. 2276\u20132280"},{"key":"9482_CR20","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.1109\/TIT.2011.2105003","volume":"57","author":"C Suh","year":"2011","unstructured":"Suh C, Ramchandran K. Exact-repair mds code construction using interference alignment. IEEE Trans Inf Theory, 2011, 57: 1425\u20131442","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR21","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1109\/TIT.2014.2378255","volume":"61","author":"J Lin","year":"2015","unstructured":"Lin J, Chung W H, Han Y S, et al. A unified form of exact-MSR codes via product-matrix frameworks. IEEE Trans Inf Theory, 2015, 61: 873\u2013886","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR22","doi-asserted-by":"crossref","first-page":"3021","DOI":"10.1109\/TIT.2013.2241819","volume":"59","author":"S Papailiopoulos","year":"2013","unstructured":"Papailiopoulos S, Dimakis A G, Cadambe V R. Repair optimal erasure codes through Hadamard designs. IEEE Trans Inf Theory, 2013, 59: 3021\u20133037","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR23","doi-asserted-by":"crossref","first-page":"2974","DOI":"10.1109\/TIT.2013.2237752","volume":"59","author":"R Cadambe","year":"2013","unstructured":"Cadambe R, Jafar S A, Maleki H, et al. Asymptotic interference alignment for optimal repair of MDS codes in distributed storage. IEEE Trans Inf Theory, 2013, 59: 2974\u20132987","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR24","doi-asserted-by":"crossref","first-page":"1597","DOI":"10.1109\/TIT.2012.2227110","volume":"59","author":"I Tamo","year":"2013","unstructured":"Tamo I, Wang Z, Bruck J. Zigzag codes: MDS array codes with optimal rebuilding. IEEE Trans Inf Theory, 2013, 59: 1597\u20131616","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR25","first-page":"1374","volume-title":"Proceedings of the 49th Annual Allerton Conference on Communication, Control, and Computing, Monticello","author":"Y Wang","year":"2011","unstructured":"Wang Y, Tamo I, Bruck J. On codes for optimal rebuilding access. In: Proceedings of the 49th Annual Allerton Conference on Communication, Control, and Computing, Monticello, 2011. 1374\u20131381"},{"key":"9482_CR26","first-page":"1850","volume-title":"Proceedings of the 45th Asilomar Conference on Signals, Systems and Computers, Pacific Grove","author":"R Cadambe","year":"2011","unstructured":"Cadambe R, Huang C, Li J, et al. Polynomial length MDS codes with optimal repair in distributed storage. In: Proceedings of the 45th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, 2011. 1850\u20131854"},{"key":"9482_CR27","first-page":"1182","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Cambridge","author":"Y Wang","year":"2012","unstructured":"Wang Y, Tamo I, Bruck J. Long MDS codes for optimal repair bandwidth. In: Proceedings of IEEE International Symposium on Information Theory, Cambridge, 2012. 1182\u20131186"},{"key":"9482_CR28","doi-asserted-by":"crossref","first-page":"2028","DOI":"10.1109\/TIT.2014.2305698","volume":"60","author":"I Tamo","year":"2014","unstructured":"Tamo I, Wang Y, Bruck J. Access versus bandwidth in codes for storage. IEEE Trans Inf Theory, 2014, 60: 2028\u20132037","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR29","doi-asserted-by":"crossref","first-page":"2770","DOI":"10.1109\/TIT.2014.2309000","volume":"60","author":"S Goparaju","year":"2014","unstructured":"Goparaju S, Tamo I, Calderbank R. An improved sub-packetization bound for minimum storage regenerating codes. IEEE Trans Inf Theory, 2014, 60: 2770\u20132779","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR30","first-page":"2051","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Hong Kong","author":"B Sasidharan","year":"2015","unstructured":"Sasidharan B, Agarwal K, Kumar P V. A high-rate MSR code with polynomial sub-packetization level. In: Proceedings of IEEE International Symposium on Information Theory, Hong Kong, 2015. 2051\u20132055"},{"key":"9482_CR31","volume-title":"Proceedings of Information Theory and Applications Workshop, La Jolla","author":"S Rawat","year":"2016","unstructured":"Rawat S, Koyluoglu O O, Vishwanath S. Progress on high-rate MSR codes: enabling arbitrary number of helper nodes. In: Proceedings of Information Theory and Applications Workshop, La Jolla, 2016"},{"key":"9482_CR32","doi-asserted-by":"crossref","first-page":"6318","DOI":"10.1109\/TIT.2017.2690662","volume":"63","author":"S Goparaju","year":"2017","unstructured":"Goparaju S, Fazeli A, Vardy A. Minimum storage regenerating codes for all parameters. IEEE Trans Inf Theory, 2017, 63: 6318\u20136328","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR33","volume-title":"Proceedings of the 21st National Conference on Communications, Mumbai","author":"K Agarwal","year":"2015","unstructured":"Agarwal K, Sasidharan B, Kumar P V. An alternate construction of an access-optimal regenerating code with optimal sub-packetization level. In: Proceedings of the 21st National Conference on Communications, Mumbai, 2015"},{"key":"9482_CR34","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N Alon","year":"1999","unstructured":"Alon N. Combinatorial nullstellensatz. Combinator Probab Comp, 1999, 8: 7\u201329","journal-title":"Combinator Probab Comp"},{"key":"9482_CR35","doi-asserted-by":"crossref","first-page":"2015","DOI":"10.1109\/TIT.2017.2658660","volume":"63","author":"N Raviv","year":"2017","unstructured":"Raviv N, Silberstein N, Etzion T. Constructions of high-rate minimum storage regenerating codes over small fields. IEEE Trans Inf Theory, 2017, 63: 2015\u20132038","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR36","doi-asserted-by":"crossref","first-page":"2001","DOI":"10.1109\/TIT.2017.2661313","volume":"63","author":"M Ye","year":"2017","unstructured":"Ye M, Barg A. Explicit constructions of high-rate MDS array codes with optimal repair bandwidth. IEEE Trans Inf Theory, 2017, 63: 2001\u20132014","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR37","doi-asserted-by":"crossref","first-page":"6307","DOI":"10.1109\/TIT.2017.2730863","volume":"63","author":"M Ye","year":"2017","unstructured":"Ye M, Barg A. Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization. IEEE Trans Inf Theory, 2017, 63: 6307\u20136317","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR38","volume-title":"An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and all-node repair","author":"B Sasidharan","year":"2016","unstructured":"Sasidharan B, Vajha M, Kumar P V. An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and all-node repair. 2016. ArXiv:1607.07335"},{"key":"9482_CR39","first-page":"1623","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Aachen","author":"J Li","year":"2017","unstructured":"Li J, Tang H, Tian C. A generic transformation for optimal repair bandwidth and rebuilding access in MDS codes. In: Proceedings of IEEE International Symposium on Information Theory, Aachen, 2017. 1623\u20131627"},{"key":"9482_CR40","volume-title":"A tight lower bound on the sub-packetization level of optimal-access MSR and MDS codes","author":"S B Balaji","year":"2018","unstructured":"Balaji S B, Kumar P V. A tight lower bound on the sub-packetization level of optimal-access MSR and MDS codes. 2018. ArXiv:1710.05876"},{"key":"9482_CR41","volume-title":"Explicit MSR codes with optimal access, optimal sub-packetization and small field size for d = k + 1, k + 2, k + 3","author":"M Vajha","year":"2018","unstructured":"Vajha M, Balaji S B, Kumar P V. Explicit MSR codes with optimal access, optimal sub-packetization and small field size for d = k + 1, k + 2, k + 3. 2018. ArXiv:1804.00598"},{"key":"9482_CR42","doi-asserted-by":"crossref","first-page":"3121","DOI":"10.1109\/TIT.2018.2796599","volume":"64","author":"K Mahdaviani","year":"2018","unstructured":"Mahdaviani K, Mohajer S, Khisti A. Product matrix MSR codes with bandwidth adaptive exact repair. IEEE Trans Inf Theory, 2018, 64: 3121\u20133135","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR43","doi-asserted-by":"crossref","first-page":"1837","DOI":"10.1109\/TIT.2011.2173792","volume":"58","author":"B Shah","year":"2012","unstructured":"Shah B, Rashmi K V, Kumar P V, et al. Distributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff. IEEE Trans Inf Theory, 2012, 58: 1837\u20131852","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR44","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1109\/JSAC.2014.140516","volume":"32","author":"C Tian","year":"2014","unstructured":"Tian C. Characterizing the rate region of the (4,3,3) exact-repair regenerating codes. IEEE J Sel Areas Commun, 2014, 32: 967\u2013975","journal-title":"IEEE J Sel Areas Commun"},{"key":"9482_CR45","unstructured":"Information theory inequality prover. 2016. \nhttps:\/\/doi.org\/user-www.ie.cuhk.edu.hk\/~ITIP\/"},{"key":"9482_CR46","doi-asserted-by":"crossref","first-page":"1924","DOI":"10.1109\/18.641556","volume":"43","author":"W Yeung","year":"1997","unstructured":"Yeung W. A framework for linear information inequalities. IEEE Trans Inf Theory, 1997, 43: 1924\u20131934","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR47","doi-asserted-by":"crossref","first-page":"1933","DOI":"10.1109\/TIT.2015.2408595","volume":"61","author":"C Tian","year":"2015","unstructured":"Tian C, Sasidharan B, Aggarwal V, et al. Layered exact-repair regenerating codes via embedded error correction and block designs. IEEE Trans Inf Theory, 2015, 61: 1933\u20131947","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR48","volume-title":"Proceedings of IEEE Information Theory Workshop, Jerusalem","author":"K Senthoor","year":"2015","unstructured":"Senthoor K, Sasidharan B, Kumar V. Improved layered regenerating codes characterizing the exact-repair storagerepair bandwidth tradeoff for certain parameter sets. In: Proceedings of IEEE Information Theory Workshop, Jerusalem, 2015"},{"key":"9482_CR49","first-page":"2430","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Honolulu","author":"B Sasidharan","year":"2014","unstructured":"Sasidharan B, Senthoor K, Kumar V. An improved outer bound on the storage repair-bandwidth tradeoff of exactrepair regenerating codes. In: Proceedings of IEEE International Symposium on Information Theory, Honolulu, 2014. 2430\u20132434"},{"key":"9482_CR50","volume-title":"Outer bounds for exact repair codes","author":"I M Duursma","year":"2014","unstructured":"Duursma I M. Outer bounds for exact repair codes. 2014. ArXiv:1406.4852"},{"key":"9482_CR51","volume-title":"IEEE Trans Inf Theory (Early Access)","author":"M S Duursma","year":"2018","unstructured":"Duursma M. Shortened regenerating codes. IEEE Trans Inf Theory (Early Access), 2018. doi: 10.1109\/TIT.2018. 2840995"},{"key":"9482_CR52","first-page":"2056","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Hong Kong","author":"S Mohajer","year":"2015","unstructured":"Mohajer S, Tandon R. New bounds on the (n, k, d) storage systems with exact repair. In: Proceedings of IEEE International Symposium on Information Theory, Hong Kong, 2015. 2056\u20132060"},{"key":"9482_CR53","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1504\/IJICOT.2016.079498","volume":"3","author":"B Sasidharan","year":"2016","unstructured":"Sasidharan B, Prakash N, KrishnanM N, et al. Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes. Int J Inf Coding Theory, 2016, 3: 255\u2013298","journal-title":"Int J Inf Coding Theory"},{"key":"9482_CR54","doi-asserted-by":"crossref","first-page":"6683","DOI":"10.1109\/TIT.2016.2616137","volume":"62","author":"M Elyasi","year":"2016","unstructured":"Elyasi M, Mohajer S. Determinant coding: a novel framework for exact-repair regenerating codes. IEEE Trans Inf Theory, 2016, 62: 6683\u20136697","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR55","first-page":"934","volume-title":"Proceedings of the 55th Annual Allerton Conference on Communication, Control, and Computing, Monticello","author":"M Elyasi","year":"2017","unstructured":"Elyasi M, Mohajer S. Exact-repair trade-off for (n, k = d - 1, d) regenerating codes. In: Proceedings of the 55th Annual Allerton Conference on Communication, Control, and Computing, Monticello, 2017. 934\u2013941"},{"key":"9482_CR56","first-page":"859","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Hong Kong","author":"N Prakash","year":"2015","unstructured":"Prakash N, Krishnan N. The storage-repair-bandwidth trade-off of exact repair linear regenerating codes for the case d = k = n - 1. In: Proceedings of IEEE International Symposium on Information Theory, Hong Kong, 2015. 859\u2013863"},{"key":"9482_CR57","first-page":"2061","volume-title":"Proceedings of IEEE International Symposium on Information Theory (ISIT), Hong Kong","author":"M Elyasi","year":"2015","unstructured":"Elyasi M, Mohajer S, Tandon R. Linear exact repair rate region of (k + 1, k, k) distributed storage systems: a new approach. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Hong Kong, 2015. 2061\u20132065"},{"key":"9482_CR58","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1109\/JSAC.2010.100216","volume":"28","author":"Y Hu","year":"2010","unstructured":"Hu Y, Xu Y, Wang X, et al. Cooperative recovery of distributed storage systems from multiple losses with network coding. IEEE J Sel Areas Commun, 2010, 28: 268\u2013276","journal-title":"IEEE J Sel Areas Commun"},{"key":"9482_CR59","volume-title":"Proceedings of International Symposium on Networking Coding, Beijing","author":"M Kermarrec","year":"2011","unstructured":"Kermarrec M, Scouarnec N L, Straub G. Repairing multiple failures with coordinated and adaptive regenerating codes. In: Proceedings of International Symposium on Networking Coding, Beijing, 2011"},{"key":"9482_CR60","doi-asserted-by":"crossref","first-page":"7229","DOI":"10.1109\/TIT.2013.2274265","volume":"59","author":"W Shum","year":"2013","unstructured":"Shum W, Hu Y. Cooperative regenerating codes. IEEE Trans Inf Theory, 2013, 59: 7229\u20137258","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR61","first-page":"400","volume-title":"Proceedings of IEEE INFOCOM, Turin","author":"Y Wang","year":"2013","unstructured":"Wang Y, Zhang Z F. Exact cooperative regenerating codes with minimum-repair-bandwidth for distributed storage. In: Proceedings of IEEE INFOCOM, Turin, 2013. 400\u2013404"},{"key":"9482_CR62","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1504\/IJICOT.2016.079495","volume":"3","author":"W Shum","year":"2016","unstructured":"Shum W, Chen J. Cooperative repair of multiple node failures in distributed storage systems. Int J Inf Coding Theory, 2016, 3: 299\u2013323","journal-title":"Int J Inf Coding Theory"},{"key":"9482_CR63","first-page":"1197","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Cambridge","author":"L Scouarnec","year":"2012","unstructured":"Scouarnec L. Exact scalar minimum storage coordinated regenerating codes. In: Proceedings of IEEE International Symposium on Information Theory, Cambridge, 2012. 1197\u20131201"},{"key":"9482_CR64","volume-title":"Optimal MDS codes for cooperative repair","author":"M Ye","year":"2018","unstructured":"Ye M, Barg A. Optimal MDS codes for cooperative repair. 2018. ArXiv:1801.09665"},{"key":"9482_CR65","first-page":"2440","volume-title":"Proceedings of IEEE International Symposium on Information Theory Proceedings, Honolulu","author":"Q Liu","year":"2014","unstructured":"Liu Q, Oggier F E. On storage codes allowing partially collaborative repairs. In: Proceedings of IEEE International Symposium on Information Theory Proceedings, Honolulu, 2014. 2440\u20132444"},{"key":"9482_CR66","first-page":"378","volume-title":"Proceedings of International Symposium on Information Theory and its Applications, Melbourne","author":"Q Liu","year":"2014","unstructured":"Liu Q, Oggier F E. Two storage code constructions allowing partially collaborative repairs. In: Proceedings of International Symposium on Information Theory and its Applications, Melbourne, 2014. 378\u2013382"},{"key":"9482_CR67","doi-asserted-by":"crossref","first-page":"5228","DOI":"10.1109\/TIT.2014.2319271","volume":"60","author":"O Koyluoglu","year":"2014","unstructured":"Koyluoglu O, Rawat A S, Vishwanath S. Secure cooperative regenerating codes for distributed storage systems. IEEE Trans Inf Theory, 2014, 60: 5228\u20135244","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR68","doi-asserted-by":"crossref","first-page":"6218","DOI":"10.1109\/TIT.2016.2608949","volume":"62","author":"K Huang","year":"2016","unstructured":"Huang K, Parampalli U, Xian M. Security concerns in minimum storage cooperative regenerating codes. IEEE Trans Inf Theory, 2016, 62: 6218\u20136232","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR69","first-page":"5802","volume":"63","author":"V Rashmi","year":"2017","unstructured":"Rashmi V, Shah N B, Ramchandran K. A piggybacking design framework for read-and download-efficient distributed storage codes. IEEE Trans Inf Theory, 2017, 63: 5802\u20135820","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR70","first-page":"2109","volume-title":"Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona","author":"V Guruswami","year":"2017","unstructured":"Guruswami V, Rawat S. MDS code constructions with small sub-packetization and near-optimal repair bandwidth. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona, 2017. 2109\u20132122"},{"key":"9482_CR71","first-page":"1281","volume":"20","author":"K Kralevska","year":"2016","unstructured":"Kralevska K, Gligoroski D, \u00d8verby H. General sub-packetized access-optimal regenerating codes. IEEE Commun Lett, 2016, 20: 1281\u20131284","journal-title":"IEEE Commun Lett"},{"key":"9482_CR72","first-page":"2043","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Aachen","author":"S Rawat","year":"2017","unstructured":"Rawat S, Tamo I, Guruswami V, et al. o-MSR codes with small sub-packetization. In: Proceedings of IEEE International Symposium on Information Theory, Aachen, 2017. 2043\u20132047"},{"key":"9482_CR73","volume-title":"Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton","author":"S Rouayheb","year":"2010","unstructured":"Rouayheb S Y E, Ramchandran K. Fractional repetition codes for repair in distributed storage systems. In: Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton, 2010"},{"key":"9482_CR74","first-page":"2338","volume-title":"Proceedings of IEEE International Symposium on Information Theory Proceedings, St. Petersburg","author":"S Pawar","year":"2011","unstructured":"Pawar S, Noorshams N, Rouayheb S Y E, et al. DRESS codes for the storage cloud: simple randomized constructions. In: Proceedings of IEEE International Symposium on Information Theory Proceedings, St. Petersburg, 2011. 2338\u20132342"},{"key":"9482_CR75","doi-asserted-by":"crossref","first-page":"4164","DOI":"10.1109\/TIT.2015.2442231","volume":"61","author":"N Silberstein","year":"2015","unstructured":"Silberstein N, Etzion T. Optimal fractional repetition codes based on graphs and designs. IEEE Trans Inf Theory, 2015, 61: 4164\u20134180","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR76","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1109\/TIT.2016.2531720","volume":"62","author":"O Olmez","year":"2016","unstructured":"Olmez O, Ramamoorthy A. Fractional repetition codes with flexible repair from combinatorial designs. IEEE Trans Inf Theory, 2016, 62: 1565\u20131591","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR77","first-page":"1366","volume-title":"Proceedings of the 49th Annual Allerton Conference on Communication, Control, and Computing, Monticello","author":"C Koo","year":"2011","unstructured":"Koo C, Gill J T. Scalable constructions of fractional repetition codes in distributed storage systems. In: Proceedings of the 49th Annual Allerton Conference on Communication, Control, and Computing, Monticello, 2011. 1366\u20131373"},{"key":"9482_CR78","volume-title":"The existence of fractional repetition codes","author":"T Ernvall","year":"2012","unstructured":"Ernvall T. The existence of fractional repetition codes. 2012. ArXiv:1201.3547"},{"key":"9482_CR79","doi-asserted-by":"crossref","first-page":"6734","DOI":"10.1109\/TIT.2011.2162191","volume":"57","author":"S Pawar","year":"2011","unstructured":"Pawar S, Rouayheb S Y E, Ramchandran K. Securing dynamic distributed storage systems against eavesdropping and adversarial attacks. IEEE Trans Inf Theory, 2011, 57: 6734\u20136753","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR80","first-page":"1202","volume-title":"Proceeding of IEEE International Symposium on Information Theory Proceedings, Cambridge","author":"V Rashmi","year":"2012","unstructured":"Rashmi V, Shah N B, Ramchandran K, et al. Regenerating codes for errors and erasures in distributed storage. In: Proceeding of IEEE International Symposium on Information Theory Proceedings, Cambridge, 2012. 1202\u20131206"},{"key":"9482_CR81","doi-asserted-by":"crossref","first-page":"1621","DOI":"10.1109\/TIT.2017.2769101","volume":"64","author":"V Rashmi","year":"2018","unstructured":"Rashmi V, Shah N B, Ramchandran K, et al. Information-theoretically secure erasure codes for distributed storage. IEEE Trans Inf Theory, 2018, 64: 1621\u20131646","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR82","doi-asserted-by":"crossref","first-page":"3477","DOI":"10.1109\/TIT.2016.2544340","volume":"62","author":"R Tandon","year":"2016","unstructured":"Tandon R, Amuru D, Clancy T C, et al. Toward optimal secure distributed storage systems with exact repair. IEEE Trans Inf Theory, 2016, 62: 3477\u20133492","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR83","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1109\/TIT.2013.2288784","volume":"60","author":"S Rawat","year":"2014","unstructured":"Rawat S, Koyluoglu O O, Silberstein N, et al. Optimal locally repairable and secure codes for distributed storage systems. IEEE Trans Inf Theory, 2014, 60: 212\u2013236","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR84","volume-title":"Proceedings of International Symposium on Network Coding, Calgary","author":"S Goparaju","year":"2013","unstructured":"Goparaju S, Rouayheb S Y E, Calderbank R, et al. Data secrecy in distributed storage systems under exact repair. In: Proceedings of International Symposium on Network Coding, Calgary, 2013"},{"key":"9482_CR85","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.1109\/TIT.2016.2647601","volume":"63","author":"K Huang","year":"2017","unstructured":"Huang K, Parampalli U, Xian M. On secrecy capacity of minimum storage regenerating codes. IEEE Trans Inf Theory, 2017, 63: 1510\u20131524","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR86","first-page":"1406","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Aachen","author":"S Rawat","year":"2017","unstructured":"Rawat S. Secrecy capacity of minimum storage regenerating codes. In: Proceedings of IEEE International Symposium on Information Theory, Aachen, 2017. 1406\u20131410"},{"key":"9482_CR87","first-page":"1028","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Aachen","author":"S Kadhe","year":"2017","unstructured":"Kadhe S, Sprintson A. Security for minimum storage regenerating codes and locally repairable codes. In: Proceedings of IEEE International Symposium on Information Theory, Aachen, 2017. 1028\u20131032"},{"key":"9482_CR88","doi-asserted-by":"crossref","first-page":"7038","DOI":"10.1109\/TIT.2017.2740939","volume":"63","author":"F Ye","year":"2017","unstructured":"Ye F, Shum W, Yeung R W. The rate region for secure distributed storage systems. IEEE Trans Inf Theory, 2017, 63: 7038\u20137051","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR89","doi-asserted-by":"crossref","first-page":"7253","DOI":"10.1109\/TIT.2017.2750156","volume":"63","author":"S Shao","year":"2017","unstructured":"Shao S, Liu T, Tian C, et al. On the tradeoff region of secure exact-repair regenerating codes. IEEE Trans Inf Theory, 2017, 63: 7253\u20137266","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR90","first-page":"2531","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Nice","author":"J Han","year":"2007","unstructured":"Han J, Lastras-Montano A. Reliable memories with subline accesses. In: Proceedings of IEEE International Symposium on Information Theory, Nice, 2007. 2531\u20132535"},{"key":"9482_CR91","first-page":"79","volume-title":"Proceedings of the 6th IEEE International Symposium on Network Computing and Applications, Cambridge","author":"C Huang","year":"2007","unstructured":"Huang C, Chen H, Li J. Pyramid codes: flexible schemes to trade space for access efficiency in reliable data storage systems. In: Proceedings of the 6th IEEE International Symposium on Network Computing and Applications, Cambridge, 2007. 79\u201386"},{"key":"9482_CR92","first-page":"1215","volume-title":"Proceedings of IEEE INFOCOM, Shanghai","author":"F Oggier","year":"2011","unstructured":"Oggier F, Datta A. Self-repairing homomorphic codes for distributed storage systems. In: Proceedings of IEEE INFOCOM, Shanghai, 2011. 1215\u20131223"},{"key":"9482_CR93","doi-asserted-by":"crossref","first-page":"6925","DOI":"10.1109\/TIT.2012.2208937","volume":"58","author":"P Gopalan","year":"2012","unstructured":"Gopalan P, Huang C, Simitci H, et al. On the locality of codeword symbols. IEEE Trans Inf Theory, 2012, 58: 6925\u20136934","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR94","first-page":"2771","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Cambridge","author":"D Papailiopoulos","year":"2012","unstructured":"Papailiopoulos D, Dimakis A. Locally repairable codes. In: Proceedings of IEEE International Symposium on Information Theory, Cambridge, 2012. 2771\u20132775"},{"key":"9482_CR95","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.disc.2014.01.016","volume":"324","author":"M Forbes","year":"2014","unstructured":"Forbes M, Yekhanin S. On the locality of codeword symbols in non-linear codes. Discrete Math, 2014, 324: 78\u201384","journal-title":"Discrete Math"},{"key":"9482_CR96","first-page":"2776","volume-title":"Proceedings of IEEE International Symposium on Information Theory Proceedings, Cambridge","author":"N Prakash","year":"2012","unstructured":"Prakash N. Kamath GM, Lalitha V, et al. Optimal linear codes with a local-error-correction property. In: Proceedings of IEEE International Symposium on Information Theory Proceedings, Cambridge, 2012. 2776\u20132780"},{"key":"9482_CR97","first-page":"1819","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Istanbul","author":"N Silberstein","year":"2013","unstructured":"Silberstein N, Rawat S, Koyluoglu O O, et al. Optimal locally repairable codes via rank-metric codes. In: Proceedings of IEEE International Symposium on Information Theory, Istanbul, 2013. 1819\u20131823"},{"key":"9482_CR98","first-page":"1962","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Honolulu","author":"N Prakash","year":"2014","unstructured":"Prakash N, Lalitha V, Kumar V. Codes with locality for two erasures. In: Proceedings of IEEE International Symposium on Information Theory, Honolulu, 2014. 1962\u20131966"},{"key":"9482_CR99","doi-asserted-by":"crossref","first-page":"5280","DOI":"10.1109\/TIT.2015.2472515","volume":"61","author":"A Wang","year":"2015","unstructured":"Wang A, Zhang Z. An integer programming-based bound for locally repairable codes. IEEE Trans Inf Theory, 2015, 61: 5280\u20135294","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR100","volume-title":"Some improvements on locally repairable codes","author":"J Zhang","year":"2015","unstructured":"Zhang J, Wang X, Ge G N. Some improvements on locally repairable codes. 2015. ArXiv:1506.04822"},{"key":"9482_CR101","volume-title":"Proceedings of the 15th Canadian Workshop on Information Theory, Quebec","author":"M Mehrabi","year":"2017","unstructured":"Mehrabi M, Ardakani M. On minimum distance of locally repairable codes. In: Proceedings of the 15th Canadian Workshop on Information Theory, Quebec, 2017"},{"key":"9482_CR102","doi-asserted-by":"crossref","first-page":"4661","DOI":"10.1109\/TIT.2014.2321280","volume":"60","author":"I Tamo","year":"2014","unstructured":"Tamo I, Barg A. A family of optimal locally recoverable codes. IEEE Trans Inf Theory, 2014, 60: 4661\u20134676","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR103","volume-title":"Proceedings of the 4th International Conference on Wireless Communications, Vehicular Technology, Information Theory and Aerospace Electronic Systems, Aalborg","author":"T Ernvall","year":"2014","unstructured":"Ernvall T, Westerback T, Hollanti C. Constructions of optimal and almost optimal locally repairable codes. In: Proceedings of the 4th International Conference on Wireless Communications, Vehicular Technology, Information Theory and Aerospace Electronic Systems, Aalborg, 2014"},{"key":"9482_CR104","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1109\/TIT.2017.2713245","volume":"64","author":"J Liu","year":"2018","unstructured":"Liu J, Mesnager S, Chen L. New constructions of optimal locally recoverable codes via good polynomials. IEEE Trans Inf Theory, 2018, 64: 889\u2013899","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR105","volume-title":"Optimal LRC codes for all lenghts n 6 q","author":"O Kolosov","year":"2018","unstructured":"Kolosov O, Barg A, Tamo I, et al. Optimal LRC codes for all lenghts n 6 q. 2018. ArXiv:1802.00157"},{"key":"9482_CR106","volume-title":"Construction of optimal locally repairable codes via automorphism groups of rational function fields","author":"L F Jin","year":"2017","unstructured":"Jin L F, Ma L M, Xing C P. Construction of optimal locally repairable codes via automorphism groups of rational function fields. 2017. ArXiv:1710.09638"},{"key":"9482_CR107","first-page":"1881","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Hong Kong","author":"B Balaji","year":"2015","unstructured":"Balaji B, Kumar P V. On partial maximally-recoverable and maximally-recoverable codes. In: Proceedings of IEEE International Symposium on Information Theory, Hong Kong, 2015. 1881\u20131885"},{"key":"9482_CR108","doi-asserted-by":"crossref","first-page":"5787","DOI":"10.1109\/TIT.2015.2477406","volume":"61","author":"R Cadambe","year":"2015","unstructured":"Cadambe R, Mazumdar A. Bounds on the size of locally recoverable codes. IEEE Trans Inf Theory, 2015, 61: 5787\u20135794","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR109","doi-asserted-by":"crossref","first-page":"6268","DOI":"10.1109\/TIT.2016.2605119","volume":"62","author":"P Huang","year":"2016","unstructured":"Huang P, Yaakobi E, Uchikawa H, et al. Binary linear locally repairable codes. IEEE Trans Inf Theory, 2016, 62: 6268\u20136283","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR110","first-page":"3155","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Aachen","author":"B Balaji","year":"2017","unstructured":"Balaji B, Kumar P V. Bounds on the rate and minimum distance of codes with availability. In: Proceedings of IEEE International Symposium on Information Theory, Aachen, 2017. 3155\u20133159"},{"key":"9482_CR111","doi-asserted-by":"crossref","first-page":"1412","DOI":"10.1109\/18.133259","volume":"37","author":"K Wei","year":"1991","unstructured":"Wei K. Generalized Hamming weights for linear codes. IEEE Trans Inf Theory, 1991, 37: 1412\u20131418","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR112","first-page":"2033","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Aachen","author":"Y Wang","year":"2017","unstructured":"Wang Y, Zhang Z F, Lin D D. Bounds and constructions for linear locally repairable codes over binary fields. In: Proceedings of IEEE International Symposium on Information Theory, Aachen, 2017. 2033\u20132037"},{"key":"9482_CR113","volume-title":"Optimal binary linear locally repairable codes with disjoint repair groups","author":"J X Ma","year":"2017","unstructured":"Ma J X, Ge G N. Optimal binary linear locally repairable codes with disjoint repair groups. 2017. ArXiv:1711.07138"},{"key":"9482_CR114","doi-asserted-by":"crossref","first-page":"3481","DOI":"10.1109\/TIT.2018.2800042","volume":"64","author":"A Agarwal","year":"2018","unstructured":"Agarwal A, Barg A, Hu S, et al. Combinatorial alphabet-dependent bounds for locally recoverable codes. IEEE Trans Inf Theory, 2018, 64: 3481\u20133492","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR115","volume-title":"Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes","author":"I Tamo","year":"2016","unstructured":"Tamo I, Barg A, Goparaju S, et al. Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes. 2016. ArXiv:1603.08878"},{"key":"9482_CR116","first-page":"676","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Honolulu","author":"S Goparaju","year":"2014","unstructured":"Goparaju S, Calderbank R. Binary cyclic codes that are locally repairable. In: Proceedings of IEEE International Symposium on Information Theory, Honolulu, 2014. 676\u2013680"},{"key":"9482_CR117","volume-title":"Proceedings of IEEE Information Theory Workshop, Jerusalem","author":"A Zeh","year":"2015","unstructured":"Zeh A, Yaakobi E. Optimal linear and cyclic locally repairable codes over small fields. In: Proceedings of IEEE Information Theory Workshop, Jerusalem, 2015"},{"key":"9482_CR118","doi-asserted-by":"crossref","first-page":"3070","DOI":"10.1109\/TIT.2016.2518663","volume":"62","author":"I Tamo","year":"2016","unstructured":"Tamo I, Barg A, Frolov A. Bounds on the parameters of locally recoverable codes. IEEE Trans Inf Theory, 2016, 62: 3070\u20133083","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR119","doi-asserted-by":"crossref","first-page":"4928","DOI":"10.1109\/TIT.2017.2700859","volume":"63","author":"A Barg","year":"2017","unstructured":"Barg A, Tamo I, Vladut S. Locally recoverable codes on algebraic curves. IEEE Trans Inf Theory, 2017, 63: 4928\u20134939","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR120","volume-title":"Construction of asymptotically good locally repairable codes via automorphism groups of function fields","author":"X D Li","year":"2017","unstructured":"Li X D, Ma L M, Xing C P. Construction of asymptotically good locally repairable codes via automorphism groups of function fields. 2017. ArXiv:1711.07703"},{"key":"9482_CR121","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.1109\/LCOMM.2017.2697424","volume":"21","author":"Y Nam","year":"2017","unstructured":"Nam Y, Song H Y. Binary locally repairable codes with minimum distance at least six based on partial t-spreads. IEEE Commun Lett, 2017, 21: 1683\u20131686","journal-title":"IEEE Commun Lett"},{"key":"9482_CR122","first-page":"1247","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Hong Kong","author":"N Silberstein","year":"2015","unstructured":"Silberstein N, Zeh A. Optimal binary locally repairable codes via anticodes. In: Proceedings of IEEE International Symposium on Information Theory, Hong Kong, 2015. 1247\u20131251"},{"key":"9482_CR123","first-page":"440","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Barcelona","author":"J Hao","year":"2016","unstructured":"Hao J, Xia T, Chen B. Some results on optimal locally repairable codes. In: Proceedings of IEEE International Symposium on Information Theory, Barcelona, 2016. 440\u2013444"},{"key":"9482_CR124","doi-asserted-by":"crossref","first-page":"3182","DOI":"10.1109\/TCOMM.2016.2581163","volume":"64","author":"M Shahabinejad","year":"2016","unstructured":"Shahabinejad M, Khabbazian M, Ardakani M. A class of binary locally repairable codes. IEEE Trans Commun, 2016, 64: 3182\u20133193","journal-title":"IEEE Trans Commun"},{"key":"9482_CR125","first-page":"171","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Aachen","author":"J Hao","year":"2017","unstructured":"Hao J, Xia T, Chen B. On optimal ternary locally repairable codes. In: Proceedings of IEEE International Symposium on Information Theory, Aachen, 2017. 171\u2013175"},{"key":"9482_CR126","volume-title":"Bounds and constructions of locally repairable codes: parity-check matrix approach","author":"J Hao","year":"2016","unstructured":"Hao J, Xia S. Bounds and constructions of locally repairable codes: parity-check matrix approach. 2016. ArXiv:1601.05595"},{"key":"9482_CR127","volume-title":"Optimal locally repairable codes via elliptic curves","author":"X D Li","year":"2017","unstructured":"Li X D, Ma L M, Xing C P. Optimal locally repairable codes via elliptic curves. 2017. ArXiv:1712.03744"},{"key":"9482_CR128","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1109\/LCOMM.2017.2776141","volume":"22","author":"C Kim","year":"2018","unstructured":"Kim C, No S. New constructions of binary and ternary locally repairable codes using cyclic codes. IEEE Commun Lett, 2018, 22: 228\u2013231","journal-title":"IEEE Commun Lett"},{"key":"9482_CR129","volume-title":"Optimal locally repairable codes of distance 3 and 4 via cyclic codes","author":"Y Luo","year":"2018","unstructured":"Luo Y, Xing C P, Yuan C. Optimal locally repairable codes of distance 3 and 4 via cyclic codes. 2018. ArXiv:1801.03623"},{"key":"9482_CR130","doi-asserted-by":"crossref","first-page":"2346","DOI":"10.1109\/TCOMM.2018.2797988","volume":"66","author":"N Krishnan","year":"2018","unstructured":"Krishnan N, Puranik B, Kumar P V, et al. Exploiting locality for improved decoding of binary cyclic codes. IEEE Trans Commun, 2018, 66: 2346\u20132358","journal-title":"IEEE Trans Commun"},{"key":"9482_CR131","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1109\/18.312184","volume":"40","author":"A Y Vardy","year":"1994","unstructured":"Vardy ABe\u2019ery Y. Maximum-likelihood soft decision decoding of BCH codes. IEEE Trans Inf Theory, 1994, 40: 546\u2013554","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR132","volume-title":"Proceedings of IEEE Information Theory Workshop, Jerusalem","author":"P Huang","year":"2015","unstructured":"Huang P, Yaakobi E, Uchikawa H, et al. Cyclic linear binary locally repairable codes. In: Proceedings of IEEE Information Theory Workshop, Jerusalem, 2015"},{"key":"9482_CR133","first-page":"486","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Nice","author":"M H Chen","year":"2007","unstructured":"Chen M H, Huang C, Li J. On the maximally recoverable property for multi-protection group codes. In: Proceedings of IEEE International Symposium on Information Theory, Nice, 2007. 486\u2013490"},{"key":"9482_CR134","doi-asserted-by":"crossref","first-page":"4510","DOI":"10.1109\/TIT.2013.2252395","volume":"59","author":"M Blaum","year":"2013","unstructured":"Blaum M, Hafner L, Hetzler S. Partial-MDS codes and their application to RAID type of architectures. IEEE Trans Inf Theory, 2013, 59: 4510\u20134519","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR135","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1109\/LCOMM.2016.2627569","volume":"21","author":"G Calis","year":"2017","unstructured":"Calis G, Koyluoglu O. A general construction for PMDS codes. IEEE Commun Lett, 2017, 21: 452\u2013455","journal-title":"IEEE Commun Lett"},{"key":"9482_CR136","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Aachen","author":"R Gabrys","year":"2017","unstructured":"Gabrys R, Yaakobi E, Blaum M, et al. Constructions of partial MDS codes over small fields. In: Proceedings of IEEE International Symposium on Information Theory, Aachen, 2017"},{"key":"9482_CR137","doi-asserted-by":"crossref","first-page":"5245","DOI":"10.1109\/TIT.2014.2332338","volume":"60","author":"P Gopalan","year":"2014","unstructured":"Gopalan P, Huang C, Jenkins B, et al. Explicit maximally recoverable codes with locality. IEEE Trans Inf Theory, 2014, 60: 5245\u20135256","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR138","first-page":"1591","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Barcelona","author":"G Hu","year":"2016","unstructured":"Hu G, Yekhanin S. New constructions of SD and MR codes over small finite fields. In: Proceedings of IEEE International Symposium on Information Theory, Barcelona, 2016. 1591\u20131595"},{"key":"9482_CR139","first-page":"1876","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Hong Kong","author":"Y Chen","year":"2015","unstructured":"Chen Y, Shum K W, Yu Q, et al. Sector-disk codes and partial MDS codes with up to three global parities. In: Proceedings of IEEE International Symposium on Information Theory, Hong Kong, 2015. 1876\u20131880"},{"key":"9482_CR140","volume-title":"Construction of PMDS and SD codes extending RAID 5","author":"M Blaum","year":"2013","unstructured":"Blaum M. Construction of PMDS and SD codes extending RAID 5. 2013. ArXiv:1305.0032"},{"key":"9482_CR141","doi-asserted-by":"crossref","first-page":"2673","DOI":"10.1109\/TIT.2016.2536720","volume":"62","author":"M Blaum","year":"2016","unstructured":"Blaum M, Plank S, Schwartz M, et al. Construction of partial MDS and sector-disk codes with two global parity symbols. IEEE Trans Inf Theory, 2016, 62: 2673\u20132681","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR142","first-page":"835","volume-title":"Proceedings of the 53rd Annual Allerton Conference on Communication, Control, and Computing, Monticello","author":"V Lalitha","year":"2015","unstructured":"Lalitha V, Lokam V. Weight enumerators and higher support weights of maximally recoverable codes. In: Proceedings of the 53rd Annual Allerton Conference on Communication, Control, and Computing, Monticello, 2015. 835\u2013842"},{"key":"9482_CR143","volume-title":"Rate optimal binary linear locally repairable codes with small availability","author":"S Kadhe","year":"2017","unstructured":"Kadhe S, Calderbank R. Rate optimal binary linear locally repairable codes with small availability. 2017. ArXiv:1701.02456"},{"key":"9482_CR144","first-page":"1866","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Hong Kong","author":"Y Wang","year":"2015","unstructured":"Wang Y, Zhang Z F, Liu M L. Achieving arbitrary locality and availability in binary codes. In: Proceedings of IEEE International Symposium on Information Theory, Hong Kong, 2015. 1866\u20131870"},{"key":"9482_CR145","doi-asserted-by":"crossref","first-page":"6979","DOI":"10.1109\/TIT.2014.2351404","volume":"60","author":"Y Wang","year":"2014","unstructured":"Wang Y, Zhang Z F. Repair locality with multiple erasure tolerance. IEEE Trans Inf Theory, 2014, 60: 6979\u20136987","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR146","volume-title":"Locally repairable codes with functional repair and multiple erasure tolerance","author":"W T Song","year":"2015","unstructured":"Song W T, Yuen C. Locally repairable codes with functional repair and multiple erasure tolerance. 2015. ArXiv:1507.02796"},{"key":"9482_CR147","first-page":"1778","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Aachen","author":"B Balaji","year":"2017","unstructured":"Balaji B, Kini G R, Kumar P V. A tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures. In: Proceedings of IEEE International Symposium on Information Theory, Aachen, 2017. 1778\u20131782"},{"key":"9482_CR148","volume-title":"A bound on rate of codes with locality with sequential recovery from multiple erasures","author":"S B Balaji","year":"2016","unstructured":"Balaji S B, Kini G R, Kumar P V. A bound on rate of codes with locality with sequential recovery from multiple erasures. 2016. ArXiv:1611.08561"},{"key":"9482_CR149","doi-asserted-by":"crossref","first-page":"3513","DOI":"10.1109\/TIT.2017.2711611","volume":"64","author":"T Song","year":"2018","unstructured":"Song T, Cai K, Yuen C, et al. On sequential locally repairable codes. IEEE Trans Inf Theory, 2018, 64: 3513\u20133527","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR150","volume-title":"Proceedings of National Conference on Communications, Hyderabad","author":"B Balaji","year":"2018","unstructured":"Balaji B, Kini G R, Kumar P V. A rate-optimal construction of codes with sequential recovery with low block length. In: Proceedings of National Conference on Communications, Hyderabad, 2018"},{"key":"9482_CR151","volume-title":"Cooperative local repair in distributed storage","author":"A S Rawat","year":"2014","unstructured":"Rawat A S, Mazumdar A, Vishwanath S. Cooperative local repair in distributed storage. 2014. ArXiv:1409.3900"},{"key":"9482_CR152","volume-title":"The Electronic Journal Combinatorics","author":"G Exoo","year":"2013","unstructured":"Exoo G, Jajcay R. Dynamic cage survey. The Electronic Journal Combinatorics, 2013. \nhttps:\/\/doi.org\/pdfs.semanticscholar.org\/43b8\/2016a2ef8f394f2cb1954439248198d2c274.pdf"},{"key":"9482_CR153","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1109\/JSAC.2014.140521","volume":"32","author":"W Song","year":"2014","unstructured":"Song W, Dau H, Yuen C, et al. Optimal locally repairable linear codes. IEEE J Sel Areas Commun, 2014, 32: 1019\u20131036","journal-title":"IEEE J Sel Areas Commun"},{"key":"9482_CR154","doi-asserted-by":"crossref","first-page":"2499","DOI":"10.1109\/TIT.2017.2761120","volume":"64","author":"B Chen","year":"2018","unstructured":"Chen B, Xia T, Hao J, et al. Constructions of optimal cyclic (r, d) locally repairable codes. IEEE Trans Inf Theory, 2018, 64: 2499\u20132511","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR155","volume-title":"Proceedings of IEEE International Conference on Communications, Paris","author":"J Hao","year":"2017","unstructured":"Hao J, Xia T, Chen B. On the linear codes with (r, d)-locality for distributed storage. In: Proceedings of IEEE International Conference on Communications, Paris, 2017"},{"key":"9482_CR156","first-page":"1257","volume-title":"Proceedings of International Symposium on Information Theory (ISIT), Hong Kong","author":"B Sasidharan","year":"2015","unstructured":"Sasidharan B, Agarwal K, Kumar P V. Codes with hierarchical locality. In: Proceedings of International Symposium on Information Theory (ISIT), Hong Kong, 2015. 1257\u20131261"},{"key":"9482_CR157","volume-title":"Proceedings of IEEE International Symposium on Information Theory (accepted), Hong Kong","author":"S Ballentine","year":"2018","unstructured":"Ballentine S, Barg A. Codes on curves with hierarchical locality. In: Proceedings of IEEE International Symposium on Information Theory (accepted), Hong Kong, 2018"},{"key":"9482_CR158","first-page":"89","volume-title":"Proceedings of the 8th International Conference on Peer-to-Peer Computing, Aachen","author":"A Duminuco","year":"2008","unstructured":"Duminuco A, Biersack E. Hierarchical codes: how to make erasure codes attractive for peer-to-peer storage systems. In: Proceedings of the 8th International Conference on Peer-to-Peer Computing, Aachen, 2008. 89\u201398"},{"key":"9482_CR159","doi-asserted-by":"crossref","first-page":"4637","DOI":"10.1109\/TIT.2014.2329872","volume":"60","author":"M Kamath","year":"2014","unstructured":"Kamath M, Prakash N, Lalitha V, et al. Codes with local regeneration and erasure correction. IEEE Trans Inf Theory, 2014, 60: 4637\u20134660","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR160","volume-title":"Repair duality with locally repairable and locally regenerating codes","author":"D Gligoroski","year":"2017","unstructured":"Gligoroski D, Kralevska K, Jensen R E, et al. Repair duality with locally repairable and locally regenerating codes. 2017. ArXiv:1701.06664"},{"key":"9482_CR161","first-page":"1041","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Honolulu","author":"H D L Hollmann","year":"2014","unstructured":"Hollmann H D L. On the minimum storage overhead of distributed storage codes with a given repair locality. In: Proceedings of IEEE International Symposium on Information Theory, Honolulu, 2014. 1041\u20131045"},{"key":"9482_CR162","first-page":"849","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Hong Kong","author":"I Ahmad","year":"2015","unstructured":"Ahmad I, Wang C. When locally repairable codes meet regenerating codes \u2014 what if some helpers are unavailable. In: Proceedings of IEEE International Symposium on Information Theory, Hong Kong, 2015. 849\u2013853"},{"key":"9482_CR163","volume-title":"Codes with combined locality and regeneration having optimal Rate, dmin and linear field size","author":"M N Krishnan","year":"2018","unstructured":"Krishnan M N, Anantha N R, Kumar P V. Codes with combined locality and regeneration having optimal Rate, dmin and linear field size. 2018. ArXiv:1804.00564"},{"key":"9482_CR164","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1109\/JSAC.2014.140519","volume":"32","author":"K Shanmugam","year":"2014","unstructured":"Shanmugam K, Papailiopoulos S, Dimakis A G, et al. A repair framework for scalar MDS codes. IEEE J Sel Areas Commun, 2014, 32: 998\u20131007","journal-title":"IEEE J Sel Areas Commun"},{"key":"9482_CR165","first-page":"5684","volume":"63","author":"V Guruswami","year":"2017","unstructured":"Guruswami V, Wootters M. Repairing Reed-Solomon codes. IEEE Trans Inf Theory, 2017, 63: 5684\u20135698","journal-title":"IEEE Trans Inf Theory"},{"key":"9482_CR166","first-page":"185","volume":"68","author":"J MacWilliams","year":"1977","unstructured":"MacWilliams J, Sloane N J A. The theory of error-correcting codes. Elsevier, 1977, 68: 185\u2013186","journal-title":"Elsevier"},{"key":"9482_CR167","first-page":"346","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Aachen","author":"H Dau","year":"2017","unstructured":"Dau H, Milenkovic O. Optimal repair schemes for some families of full-length Reed-Solomon codes. In: Proceedings of IEEE International Symposium on Information Theory, Aachen, 2017. 346\u2013350"},{"key":"9482_CR168","first-page":"1202","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Barcelona","author":"M Ye","year":"2016","unstructured":"Ye M, Barg A. Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth. In: Proceedings of IEEE International Symposium on Information Theory, Barcelona, 2016. 1202\u20131206"},{"key":"9482_CR169","first-page":"950","volume-title":"Proceedings of the 55th Annual Allerton Conference on Communication, Control, and Computing, Monticello","author":"A Chowdhury","year":"2017","unstructured":"Chowdhury A, Vardy A. Improved schemes for asymptotically optimal repair of MDS codes. In: Proceedings of the 55th Annual Allerton Conference on Communication, Control, and Computing, Monticello, 2017. 950\u2013957"},{"key":"9482_CR170","first-page":"216","volume-title":"Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, Berkeley","author":"I Tamo","year":"2017","unstructured":"Tamo I, Ye M, Barg A. Optimal repair of reed-solomon codes: achieving the cut-set bound. In: Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, Berkeley, 2017. 216\u2013227"},{"key":"9482_CR171","volume-title":"Repairing Reed-Solomon codes with multiple erasures","author":"S H Dau","year":"2016","unstructured":"Dau S H, Duursma I M, Kiah H M, et al. Repairing Reed-Solomon codes with multiple erasures. 2016. ArXiv:1612.01361"},{"key":"9482_CR172","first-page":"1145","volume-title":"Proceedings of the 55th Annual Allerton Conference on Communication, Control, and Computing, Monticello","author":"B Bartan","year":"2017","unstructured":"Bartan B, Wootters M. Repairing multiple failures for scalar MDS codes. In: Proceedings of the 55th Annual Allerton Conference on Communication, Control, and Computing, Monticello, 2017. 1145\u20131152"},{"key":"9482_CR173","volume-title":"Repairing Reed-Solomon codes: universally achieving the cut-set bound for any number of erasures","author":"M Ye","year":"2017","unstructured":"Ye M, Barg A. Repairing Reed-Solomon codes: universally achieving the cut-set bound for any number of erasures. 2017. ArXiv:1710.07216"},{"key":"9482_CR174","volume-title":"Capacity bounds for distributed storage","author":"M Luby","year":"2016","unstructured":"Luby M. Capacity bounds for distributed storage. 2016. ArXiv:1610.03541"},{"key":"9482_CR175","volume-title":"Liquid cloud storage","author":"M Luby","year":"2017","unstructured":"Luby M, Padovani R, Richardson T J, et al. Liquid cloud storage. 2017. ArXiv:1705.07983"},{"key":"9482_CR176","first-page":"15","volume-title":"Proceedings of USENIX Annual Technical Conference, Boston","author":"C Huang","year":"2012","unstructured":"Huang C, Simitci H, Xu Y, et al. Erasure coding in windows azure storage. In: Proceedings of USENIX Annual Technical Conference, Boston, 2012. 15\u201326"},{"key":"9482_CR177","unstructured":"Gantenbein D. A better way to store data. Microsoft research blog. \nhttps:\/\/doi.org\/www.microsoft.com\/en-us\/research\/blog\/better-way-store-data\/"},{"key":"9482_CR178","unstructured":"CEPH. Locally repairable erasure code plugin. \nhttps:\/\/doi.org\/docs.ceph.com\/docs\/master\/rados\/operations\/erasure-codelrc\/"},{"key":"9482_CR179","first-page":"331","volume-title":"Proceedings of ACM SIGCOMM Conference, Chicago","author":"V Rashmi","year":"2014","unstructured":"Rashmi V, Shah N B, Gu D, et al. A \u201chitchhiker\u2019s\u201d guide to fast and efficient data reconstruction in erasure-coded data centers. In: Proceedings of ACM SIGCOMM Conference, Chicago, 2014. 331\u2013342"},{"key":"9482_CR180","volume-title":"IEEE Trans Big Data","author":"K Kralevska","year":"2017","unstructured":"Kralevska K, Gligoroski D, Jensen E, et al. Hashtag erasure codes: from theory to practice. IEEE Trans Big Data, 2017. doi: 10.1109\/TBDATA.2017.2749255"},{"key":"9482_CR181","volume-title":"Proceedings of the 6th USENIX Workshop on Hot Topics in Storage and File Systems, Philadelphia","author":"N Krishnan","year":"2014","unstructured":"Krishnan N, Prakash N, Lalitha V, et al. Evaluation of codes with inherent double replication for Hadoop. In: Proceedings of the 6th USENIX Workshop on Hot Topics in Storage and File Systems, Philadelphia, 2014"},{"key":"9482_CR182","first-page":"81","volume-title":"Proceedings of the 13th USENIX Conference on File and Storage Technologies, Santa Clara","author":"V Rashmi","year":"2015","unstructured":"Rashmi V, Nakkiran P, Wang J, et al. Having your cake and eating it too: jointly optimal erasure codes for I\/O, storage, and network-bandwidth. In: Proceedings of the 13th USENIX Conference on File and Storage Technologies, Santa Clara, 2015. 81\u201394"},{"key":"9482_CR183","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1109\/TPDS.2016.2623309","volume":"28","author":"J Li","year":"2017","unstructured":"Li J, Li B. Beehive: erasure codes for fixing multiple failures in distributed storage systems. IEEE Trans Parallel Distrib Syst, 2017, 28: 1257\u20131270","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"9482_CR184","first-page":"81","volume-title":"Proceedings of the 14th USENIX Conference on File and Storage Technologies, Santa Clara","author":"L Pamies-Juarez","year":"2016","unstructured":"Pamies-Juarez L, Blagojevic F, Mateescu R, et al. Opening the chrysalis: on the real repair performance of MSR codes. In: Proceedings of the 14th USENIX Conference on File and Storage Technologies, Santa Clara, 2016. 81\u201394"},{"key":"9482_CR185","first-page":"887","volume-title":"Proceedings of IEEE International Symposium on Information Theory, Istanbul","author":"E Gad","year":"2013","unstructured":"Gad E, Mateescu R, Blagojevic F, et al. Repair-optimal MDS array codes over GF(2). In: Proceedings of IEEE International Symposium on Information Theory, Istanbul, 2013. 887\u2013891"},{"key":"9482_CR186","first-page":"139","volume-title":"Proceedings of the 16th USENIX Conference on File and Storage Technologies, Oakland","author":"M Vajha","year":"2018","unstructured":"Vajha M, Ramkumar V, Puranik B, et al. Clay codes: moulding MDS codes to yield an MSR code. In: Proceedings of the 16th USENIX Conference on File and Storage Technologies, Oakland, 2018. 139\u2013154"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9482-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-018-9482-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9482-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T12:22:15Z","timestamp":1576239735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-018-9482-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,6]]},"references-count":186,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["9482"],"URL":"https:\/\/doi.org\/10.1007\/s11432-018-9482-6","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,6]]},"assertion":[{"value":"5 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"100301"}}