{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T01:48:57Z","timestamp":1648777737133},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T00:00:00Z","timestamp":1296518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1109\/tit.2010.2094812","type":"journal-article","created":{"date-parts":[[2011,1,21]],"date-time":"2011-01-21T20:15:42Z","timestamp":1295640942000},"page":"910-919","source":"Crossref","is-referenced-by-count":10,"title":["On the Number of Errors Correctable with Codes on Graphs"],"prefix":"10.1109","volume":"57","author":[{"given":"Alexander","family":"Barg","sequence":"first","affiliation":[]},{"given":"Arya","family":"Mazumdar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313083"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.910593"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946009020021"},{"key":"ref15","first-page":"18","article-title":"estimation of the error-correcting complexity of gallager low-density codes","volume":"11","author":"zyablov","year":"1975","journal-title":"Probl Inf Trans"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2003.10.002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860415"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913261"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1999.767979"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/4234.781010"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.846392"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"433","DOI":"10.3934\/amc.2008.2.433","article-title":"Weight distribution and decoding of codes on hypergraph","volume":"2","author":"barg","year":"2008","journal-title":"Adv Math Commun"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90112-F"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5695090\/05695098.pdf?arnumber=5695098","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:33Z","timestamp":1633909653000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5695098\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":15,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2094812","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2]]}}}