{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:48:00Z","timestamp":1729637280364,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1109\/acssc.2011.6190087","type":"proceedings-article","created":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T17:16:13Z","timestamp":1335892573000},"page":"669-673","source":"Crossref","is-referenced-by-count":3,"title":["Achieving flexibility in LDPC code design by absorbing set elimination"],"prefix":"10.1109","author":[{"given":"Jiajun","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Jiadong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Shayan","family":"Garani Srinivasa","sequence":"additional","affiliation":[]},{"given":"Lara","family":"Dolecek","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/AERO.2005.1559693"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2003.817545"},{"key":"11","article-title":"Array-codes as low-density parity-check codes","author":"fan","year":"0","journal-title":"Proc of Second Int Symp on Turbo Codes and Iter Info Proc (ISTC) Brest France Sep 2000"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2006.44"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034781"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.11.080105"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/icc.2011.5962723"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2010.5592767"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110150"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878179"},{"key":"9","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF02570718","article-title":"Almost optimal set covers in finite VC-dimension","volume":"14","author":"bro?nnimann","year":"1995","journal-title":"Discre Comput Geom"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034068"}],"event":{"name":"2011 45th Asilomar Conference on Signals, Systems and Computers","start":{"date-parts":[[2011,11,6]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2011,11,9]]}},"container-title":["2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6185739\/6189941\/06190087.pdf?arnumber=6190087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T14:11:23Z","timestamp":1497967883000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6190087\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/acssc.2011.6190087","relation":{},"subject":[],"published":{"date-parts":[[2011,11]]}}}