{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:02Z","timestamp":1772283602782,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/isit.2012.6283041","type":"proceedings-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T20:57:57Z","timestamp":1346360277000},"page":"1182-1186","source":"Crossref","is-referenced-by-count":54,"title":["Long MDS codes for optimal repair bandwidth"],"prefix":"10.1109","author":[{"given":"Zhiying","family":"Wang","sequence":"first","affiliation":[]},{"given":"Itzhak","family":"Tamo","sequence":"additional","affiliation":[]},{"given":"Jehoshua","family":"Bruck","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120327"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283041"},{"key":"13","author":"tamo","year":"2011","journal-title":"Zigzag Codes MDS Array Codes with Optimal Rebuilding"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283042"},{"key":"11","author":"suh","year":"2010","journal-title":"On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033733"},{"key":"3","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"},{"key":"2","author":"cadambe","year":"2011","journal-title":"Optimal Repair of MDS Codes in Distributed Storage Via Subspace Interference Alignment"},{"key":"1","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":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2105003"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120328"},{"key":"6","article-title":"Distributed storage codes through Hadamard designs","author":"papailiopoulos","year":"2011","journal-title":"ISIT"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/WINC.2010.5507931"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178588"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394538"}],"event":{"name":"2012 IEEE International Symposium on Information Theory - ISIT","location":"Cambridge, MA, USA","start":{"date-parts":[[2012,7,1]]},"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\/06283041.pdf?arnumber=6283041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T01:09:58Z","timestamp":1490144998000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6283041\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2012.6283041","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}