{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:32:40Z","timestamp":1725535960605},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/isit.2012.6283042","type":"proceedings-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T20:57:57Z","timestamp":1346360277000},"page":"1187-1191","source":"Crossref","is-referenced-by-count":11,"title":["Access vs. bandwidth in codes for storage"],"prefix":"10.1109","author":[{"given":"Itzhak","family":"Tamo","sequence":"first","affiliation":[]},{"given":"Zhiying","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jehoshua","family":"Bruck","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283041"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205898"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120327"},{"key":"15","article-title":"Deterministic regenerating codes for distributed storage","author":"wu","year":"0","journal-title":"Allerton Conference on Control Computing and Communication Urbana-Champaign IL 2007"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5206008"},{"journal-title":"Zigzag Codes MDS Array Codes with Optimal Rebuilding","year":"0","author":"tamo","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283042"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513263"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033733"},{"journal-title":"Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Data Storage","year":"0","author":"cadambe","key":"3"},{"key":"2","article-title":"Permutation code: Optimal exactrepair of a single failed node in MDS code based distributed storage systems","author":"cadambe","year":"2011","journal-title":"ISIT"},{"key":"1","article-title":"Polynomial Length MDS Codes with Optimal Repair in Distributed Storage Systems","author":"cadambe","year":"0","journal-title":"Proceedings of 45th Asilomar Conference on Signals Systems and Computing Nov 2011"},{"journal-title":"Distributed Storage Codes with Repair-by-transfer and Non-achievability of Interior Points on the Storage-bandwidth Tradeoff","year":"2010","author":"shah","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394538"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120328"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033731"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178588"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033732"}],"event":{"name":"2012 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2012,7,1]]},"location":"Cambridge, MA, USA","end":{"date-parts":[[2012,7,6]]}},"container-title":["2012 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6268627\/6281806\/06283042.pdf?arnumber=6283042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T01:05:33Z","timestamp":1490144733000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6283042\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2012.6283042","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}