{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T13:58:59Z","timestamp":1769263139364,"version":"3.49.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/isit.2012.6283534","type":"proceedings-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T20:57:57Z","timestamp":1346360277000},"page":"1558-1562","source":"Crossref","is-referenced-by-count":13,"title":["Update efficient codes for error correction"],"prefix":"10.1109","author":[{"given":"Arya","family":"Mazumdar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory W.","family":"Wornell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkat","family":"Chandar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","first-page":"1457","article-title":"Update efficient codes for distributed storage","author":"rawat","year":"2011","journal-title":"IEEE International Symposium on Information Theory"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1992.6780893"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.51"},{"key":"12","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.800480"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706931"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154"},{"key":"10","author":"kakhaki","year":"2011","journal-title":"Capacity Achieving Linear Codes with Binary Sparse Generating Matrices"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056658"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90064-2"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548397003040"},{"key":"4","first-page":"36","article-title":"Construction of a class of linear binary codes achieving the Varshamov\/Griesmer bound","volume":"10","author":"belov","year":"1974","journal-title":"Probl Peredachi Inf"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5979095"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"}],"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\/06283534.pdf?arnumber=6283534","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T00:54:43Z","timestamp":1490144083000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6283534\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2012.6283534","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}