{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:04:02Z","timestamp":1725498242477},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1109\/ita.2011.5743618","type":"proceedings-article","created":{"date-parts":[[2011,4,8]],"date-time":"2011-04-08T23:42:30Z","timestamp":1302306150000},"page":"1-5","source":"Crossref","is-referenced-by-count":3,"title":["LDPC absorbing sets, the null space of the cycle consistency matrix, and Tanner's constructions"],"prefix":"10.1109","author":[{"given":"Jiadong","family":"Wang","sequence":"first","affiliation":[]},{"given":"Lara","family":"Dolecek","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Wesel","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2010.5592767"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2010.5613896"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/icc.2011.5962723"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.11.080105"},{"journal-title":"Graph Theory","year":"2006","author":"diestel","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2003.817545"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034781"},{"key":"ref3","article-title":"Error-floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annual Allerton Conf"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"key":"ref5","first-page":"543","article-title":"Array-codes as low-density parity-check codes","author":"fan","year":"2000","journal-title":"Proc of Second Int Symp on Turbo Codes"},{"key":"ref8","article-title":"When does one redundant parity-check equation matter","author":"laendner","year":"2006","journal-title":"Proc IEEE Global Telecomm Conf (GLOBECOM)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","article-title":"Low-Density Parity-Check Codes","author":"gallager","year":"1963"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878179"}],"event":{"name":"2011 Information Theory and Applications Workshop (ITA)","start":{"date-parts":[[2011,2,6]]},"location":"La Jolla, CA, USA","end":{"date-parts":[[2011,2,11]]}},"container-title":["2011 Information Theory and Applications Workshop"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5740083\/5743555\/05743618.pdf?arnumber=5743618","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T22:02:29Z","timestamp":1560117749000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5743618\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/ita.2011.5743618","relation":{},"subject":[],"published":{"date-parts":[[2011,2]]}}}