{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T05:45:16Z","timestamp":1751521516352,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620241","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"326-330","source":"Crossref","is-referenced-by-count":9,"title":["Array BP-XOR codes for reliable cloud storage systems"],"prefix":"10.1109","author":[{"given":"Yongge","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","first-page":"1817","article-title":"Low density mds codes and factors of complete graphs","volume":"45","author":"xu","year":"1998","journal-title":"IEEE Trans Inf Theor"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.03.017"},{"journal-title":"Efficient Secret Sharing Schemes Achieving Optimal Information Rate","year":"2013","author":"wang","key":"16"},{"key":"13","article-title":"On encoding symbol degrees of array bp-xor codes","author":"paterson","year":"2013","journal-title":"submitted for publication"},{"journal-title":"Efficient LDPC Code Based Secret Sharing Schemes and Private Data Storage in Cloud Without Encryption","year":"2013","author":"wang","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090104"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/18.746771"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/18.485722"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"},{"key":"6","first-page":"197","article-title":"Minimum-check-density codes for correcting bytes of errors, erasures, or defects","volume":"19","author":"semakov","year":"1983","journal-title":"Problems Inform Transmission"},{"journal-title":"Error-free Coding","year":"1954","author":"elias","key":"5"},{"key":"4","first-page":"1","article-title":"Row-diagonal parity for double disk failure correction","author":"corbett","year":"2004","journal-title":"FAST"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056621"},{"key":"8","first-page":"197","article-title":"STAR: An efficient coding scheme for correcting triple storage node failures","author":"huang","year":"2005","journal-title":"FAST"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620241.pdf?arnumber=6620241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T14:59:45Z","timestamp":1564498785000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620241\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620241","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}