{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:37:37Z","timestamp":1768340257192,"version":"3.49.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2011,4,1]],"date-time":"2011-04-01T00:00:00Z","timestamp":1301616000000},"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,4]]},"DOI":"10.1109\/tit.2011.2110150","type":"journal-article","created":{"date-parts":[[2011,3,15]],"date-time":"2011-03-15T17:08:26Z","timestamp":1300208906000},"page":"2213-2224","source":"Crossref","is-referenced-by-count":73,"title":["Lowering the Error Floor of LDPC Codes Using Cyclic Liftings"],"prefix":"10.1109","volume":"57","author":[{"given":"Reza","family":"Asvadi","sequence":"first","affiliation":[]},{"given":"Amir H","family":"Banihashemi","sequence":"additional","affiliation":[]},{"given":"Mahmoud","family":"Ahmadian-Attari","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.06.070048"},{"key":"ref32","first-page":"439","article-title":"Error rate estimation of finite-length low-density parity-check codes decoded by soft-decision iterative algorithms","author":"xiao","year":"2008","journal-title":"Proc ISIT 2008"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.910589"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/BSC.2006.1644556"},{"key":"ref10","author":"gross","year":"1987","journal-title":"Topological Graph Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.06.070325"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926319"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2009.090009"},{"key":"ref14","article-title":"A heuristic search for good low-density parity-check codes at short block lengths","author":"mao","year":"2001","journal-title":"Proc IEEE ICC 2001"},{"key":"ref15","author":"mackay","year":"0","journal-title":"Encyclopedia of Sparse Graph Codes"},{"key":"ref16","first-page":"1426","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41st Ann Allerton Conf Commun Contr Comput"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018347"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2015993"},{"key":"ref4","article-title":"A general method for finding low error rates of LDPC codes","author":"cole","year":"2006","journal-title":"IEEE Trans Inf Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ITW2.2006.323762"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.254892"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090806"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.839612"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090809"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090804"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.833352"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173244"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261777"},{"key":"ref24","first-page":"42","article-title":"LDPC codes constructed from protographs","author":"thorpe","year":"2003","journal-title":"IPN Progress Rep"},{"key":"ref23","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"Proc ISCTA 2001"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.08.070548"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.833048"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5730547\/05730557.pdf?arnumber=5730557","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:52:23Z","timestamp":1633909943000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5730557\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":33,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2110150","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4]]}}}