{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:40:14Z","timestamp":1729658414079,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1109\/icc.2016.7510829","type":"proceedings-article","created":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T16:28:51Z","timestamp":1469550531000},"page":"1-6","source":"Crossref","is-referenced-by-count":3,"title":["Extremal graphic model in optimizing fractional repetition codes for efficient storage repair"],"prefix":"10.1109","author":[{"given":"Guangping","family":"Xu","sequence":"first","affiliation":[]},{"given":"Qunfang","family":"Mao","sequence":"additional","affiliation":[]},{"given":"Sheng","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Hua","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Optimal Fractional Repetition Codes arXiv 1401 4734","year":"2014","author":"silberstein","key":"ref10"},{"journal-title":"New Codes and Inner Bounds for Exact Repair in Distributed Storage Systems arXiv 1402 2343","year":"2014","author":"goparaju","key":"ref11"},{"journal-title":"Handbook of Combinatorial Designs","year":"2007","author":"colburn","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2010.492869"},{"key":"ref14","first-page":"14","article-title":"A memetic algorithm for designing balanced incomplete blocks","volume":"2","author":"rueda","year":"2011","journal-title":"International Journal of Combinatorial Optimization Problems and Informatics"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707092"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394538"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120326"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483351"},{"key":"ref2","article-title":"Erasure coding in windows azure storage","author":"huang","year":"0","journal-title":"Proceedings of the 2012 USENIX Conference on Annual Technical Conference USENIX ATC"},{"key":"ref1","article-title":"Rethinking erasure codes for cloud file systems: miniminizing I\/O for recovery and degraded reads","author":"khan","year":"2012","journal-title":"Proc FAST"},{"journal-title":"Enumerating some fractional repetition codes arXiv 1303 6801","year":"2013","author":"anil","key":"ref9"}],"event":{"name":"ICC 2016 - 2016 IEEE International Conference on Communications","start":{"date-parts":[[2016,5,22]]},"location":"Kuala Lumpur, Malaysia","end":{"date-parts":[[2016,5,27]]}},"container-title":["2016 IEEE International Conference on Communications (ICC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7502491\/7510595\/07510829.pdf?arnumber=7510829","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,9,29]],"date-time":"2016-09-29T18:01:23Z","timestamp":1475172083000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7510829\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icc.2016.7510829","relation":{},"subject":[],"published":{"date-parts":[[2016,5]]}}}