{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:45:16Z","timestamp":1761662716852},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009,1]]},"DOI":"10.1109\/tit.2008.2008134","type":"journal-article","created":{"date-parts":[[2009,1,5]],"date-time":"2009-01-05T16:07:06Z","timestamp":1231171626000},"page":"53-63","source":"Crossref","is-referenced-by-count":22,"title":["The Trapping Redundancy of Linear Block Codes"],"prefix":"10.1109","volume":"55","author":[{"given":"Stefan","family":"Laendner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thorsten","family":"Hehn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olgica","family":"Milenkovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes B.","family":"Huber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref13","first-page":"4","article-title":"constructions of regular and irregular ldpc codes using ramanujan graphs and ideas from margulis","author":"rosenthal","year":"2001","journal-title":"Proc IEEE Int Symp Information Theory (ISIT)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313082"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887060"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/WIRLES.2005.1549481"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.888996"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006456"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154"},{"key":"ref28","author":"hirschfeld","year":"1979","journal-title":"Projective Geometries over Finite Fields"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887513"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref3","first-page":"1426","article-title":"error-floors of ldpc codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annu Allerton Conf Communication Control and Computing"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864441"},{"key":"ref29","author":"hirschfeld","year":"1985","journal-title":"Finite Projective Spaces of Three Dimensions"},{"key":"ref5","article-title":"characterizations of pseudo-codewords of ldpc codes","author":"koetter","year":"0","journal-title":"Adv Math"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1478-6","author":"hedayat","year":"1999","journal-title":"Orthogonal Arrays Theory and Applications"},{"key":"ref7","first-page":"165","article-title":"stopping and dead-end set enumerators for binary hamming codes","author":"weber","year":"2005","journal-title":"Proc 26th Symp Information Theory in the Benelux"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80768-0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2006.286475"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"ref20","author":"hofri","year":"1995","journal-title":"Analysis of Algorithms"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2006.888633"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.2307\/3212067"},{"key":"ref24","first-page":"767","article-title":"on the computation of the minimum distance of low-density parity-check codes","author":"hu","year":"2004","journal-title":"Proc IEEE Int Conf Communications (ICC)"},{"key":"ref23","author":"hu","year":"0","journal-title":"?Source Code for Approximating the MinDist Problem of LDPC Codes Error-Correcting Codes ? Website by D MacKay"},{"key":"ref26","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579283"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/4729739\/04729779.pdf?arnumber=4729779","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:47:25Z","timestamp":1638200845000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4729779\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":29,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2008.2008134","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}