{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:57:15Z","timestamp":1772283435191,"version":"3.50.1"},"reference-count":69,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2012,4,1]],"date-time":"2012-04-01T00:00:00Z","timestamp":1333238400000},"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":[[2012,4]]},"DOI":"10.1109\/tit.2011.2173733","type":"journal-article","created":{"date-parts":[[2012,3,26]],"date-time":"2012-03-26T21:33:00Z","timestamp":1332797580000},"page":"2280-2302","source":"Crossref","is-referenced-by-count":86,"title":["On the Construction of Structured LDPC Codes Free of Small Trapping Sets"],"prefix":"10.1109","volume":"58","author":[{"given":"Dung Viet","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Shashi Kiran","family":"Chilappagari","sequence":"additional","affiliation":[]},{"given":"Michael W.","family":"Marcellin","sequence":"additional","affiliation":[]},{"given":"Bane","family":"Vasic","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040941"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896864"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.06.070048"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.910589"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887060"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref37","author":"mackay","year":"0","journal-title":"Encyclopedia of Sparse Graph Codes"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80768-0"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.06.0700712"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034781"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838370"},{"key":"ref62","first-page":"1","article-title":"Relationships among classes of structured LDPC codes and their application to data storage","author":"djurdjevic","year":"2006","journal-title":"Proc 4th Int Symp Turbo Codes Related Top 6th Int ITG-Conf Source Channel Coding"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.831353"},{"key":"ref28","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"},{"key":"ref63","volume":"42154","author":"mahadevan","year":"2002","journal-title":"On RCD SPC codes as LDPC codes based on arrays and their equivalence to some codes constructed from Euclidean geometries and partial BIBDs"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034231"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.833037"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref66","first-page":"249","article-title":"On quasi-cyclic repeat-accumulate codes","author":"tanner","year":"1999","journal-title":"Proc 41st Annu Allerton Conf Commun Control Comput"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.254892"},{"key":"ref67","year":"2005","journal-title":"Methods and Apparatus for Encoding LDPC Codes"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860472"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926319"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503171"},{"key":"ref1","first-page":"1426","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annu Allerton Conf Commun Control Comput"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394825"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.1037"},{"key":"ref21","year":"2009","journal-title":"Trapping Set Ontology"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1109\/TCSII.2009.2027967","article-title":"Design of a multimode QC-LDPC decoder based on shift-routing network","volume":"56","author":"liu","year":"2009","journal-title":"IEEE Trans Circuits Syst II Exp Briefs"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.861667"},{"key":"ref26","first-page":"543","article-title":"Array codes as low-density parity-check codes","author":"fan","year":"2000","journal-title":"Proc 2nd Int Symp Turbo Codes Related Topics"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1109\/TVLSI.2008.2005308","article-title":"High-throughput layered LDPC decoding architecture","volume":"17","author":"cui","year":"2009","journal-title":"IEEE Trans Very Large Scale Integr Syst"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/icc.2011.5962723"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2003.814716"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2001.935867"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579283"},{"key":"ref56","article-title":"Low-density parity-check (LDPC) codes constructed from protographs","author":"thorpe","year":"2003"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828144"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref53","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"presented at the 5th Int Symp Commun Theory Appl"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828066"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040962"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907501"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2015993"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911177"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023274"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2015990"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046203"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.95.228701"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.93.198702"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405303"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090804"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878179"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"2885","DOI":"10.1109\/TIT.2007.901193","article-title":"Quasi-cyclic low-density parity-check codes with girth larger than 12","volume":"53","author":"kim","year":"2007","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TURBOCODING.2008.4658694"},{"key":"ref8","first-page":"1846","article-title":"Structured LDPC codes with low error floor based on PEG Tanner graphs","author":"lin","year":"2008","journal-title":"Proc IEEE Int Symp Circuits Syst"},{"key":"ref7","first-page":"236","article-title":"Grouping-and-shifting designs for structured LDPC codes with large girth","author":"lu","year":"2004","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2006.286581"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899516"},{"key":"ref45","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010541","author":"colbourn","year":"2006","journal-title":"Handbook of Combinatorial Designs Second Edition (Discrete Mathematics and Its Applications)"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110150"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2008.4578696"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2008.4895509"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513611"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2010.5613902"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454095"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6169172\/06169192.pdf?arnumber=6169192","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:53:31Z","timestamp":1633910011000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6169192\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4]]},"references-count":69,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2173733","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4]]}}}