{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T13:53:21Z","timestamp":1790862801186,"version":"4.1.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2010,4,1]],"date-time":"2010-04-01T00:00:00Z","timestamp":1270080000000},"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":[[2010,4]]},"DOI":"10.1109\/tit.2010.2040941","type":"journal-article","created":{"date-parts":[[2010,3,24]],"date-time":"2010-03-24T19:51:52Z","timestamp":1269460312000},"page":"1640-1650","source":"Crossref","is-referenced-by-count":54,"title":["On the Hardness of Approximating Stopping and Trapping Sets"],"prefix":"10.1109","volume":"56","author":[{"given":"Andrew","family":"McGregor","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Olgica","family":"Milenkovic","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258559"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261777"},{"key":"ref33","first-page":"1426","article-title":"error-floors of ldpc codes","author":"richardson","year":"2003","journal-title":"40th Annu Conf Communication Control and Computing"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258641"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/ISTCS.1993.253482","article-title":"approximating bounded 01 integer linear programs","author":"peleg","year":"1993","journal-title":"Proc 3rd Israel IEEE Symp on Theory and Computing Systems"},{"key":"ref30","author":"orponen","year":"1990","journal-title":"On Approximation Preserving Reductions Complete Problems and Robust Measures"},{"key":"ref37","author":"stege","year":"1999","journal-title":"An Improved Fixed-Parameter-Tractable Algorithm for Vertex Cover"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557664"},{"key":"ref35","volume":"1","year":"2005","journal-title":"Parameterized Complexity News"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00226-0"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"},{"key":"ref11","article-title":"a general method for finding low error rates of ldpc codes","author":"cole","year":"0"},{"key":"ref12","first-page":"332","article-title":"the union of minimal hitting sets: parameterized combinatorial bbounds and counting","volume":"4393","author":"damaschke","year":"2007","journal-title":"Proc 24th Symp Theoret Aspects Comput Sci STACS 2007"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1109\/TIT.2002.1003839","article-title":"finite length analysis of low-density parity-check codes","volume":"48","author":"di","year":"2002","journal-title":"IEEE Trans Inf Theory"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","author":"downey","year":"1999","journal-title":"Parameterized Complexity"},{"key":"ref15","author":"downey","year":"1997","journal-title":"The Parametrized Complexity of Some Fundamental Problems in Coding Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.806118"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.782170"},{"key":"ref18","author":"fernau","year":"2005","journal-title":"Parameterized Algorithms A Graph-Theoretic Approach"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity-Check Codes"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80768-0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.833352"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.4.538"},{"key":"ref3","first-page":"23","article-title":"some new np-complete coding problems","volume":"30","author":"barg","year":"1994","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00434-9"},{"key":"ref29","first-page":"69","article-title":"hardness of approximation results for the problem of finding the stopping distance in tanner graphs","author":"murali krishnan","year":"2006","journal-title":"FSTTCS"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/4234.905935"},{"key":"ref7","author":"chilappagari","year":"2007","journal-title":"Error Correction Capability of Column-Weight-Three LDPC Codes"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90046-X"},{"key":"ref9","author":"cesati","year":"2006","journal-title":"Compendium of Parametrized Problems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1472"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90059-1"},{"key":"ref45","first-page":"18","article-title":"estimates of the error-correction complexity of gallager's low-density codes","volume":"11","author":"zyablov","year":"1976","journal-title":"Probl Inf Transm"},{"key":"ref22","author":"garey","year":"1979","journal-title":"Computers and Intractibility A Guide to the Theory of NP-Completeness"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850102"},{"key":"ref42","article-title":"exhausting error-prone patterns in ldpc codes","author":"wang","year":"0"},{"key":"ref24","article-title":"iterative coding techniques, pseudocodewords, and their relationship","author":"koetter","year":"2005","journal-title":"Proc Workshop Applicat Statist Phys Coding Theory"},{"key":"ref41","author":"vazirani","year":"2001","journal-title":"Approximation Algorithms"},{"key":"ref23","author":"kann","year":"0","journal-title":"Compendium of NP-Hard Problems"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946008030046"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/WIRLES.2005.1549481"},{"key":"ref43","author":"wiberg","year":"1996","journal-title":"Codes and decoding on general graphs"},{"key":"ref25","first-page":"624","article-title":"hardness of set cover with intersection 1","author":"kumar","year":"2000","journal-title":"ICALP"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5437371\/05437429.pdf?arnumber=5437429","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:36:59Z","timestamp":1633916219000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5437429\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4]]},"references-count":45,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2040941","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4]]}}}