{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:58:29Z","timestamp":1729634309517,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523344","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"307-311","source":"Crossref","is-referenced-by-count":6,"title":["The benefit of thresholding in LP decoding of LDPC codes"],"prefix":"10.1109","author":[{"given":"J.","family":"Feldman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Koetter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.O.","family":"Vontobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Computationally Effi Dent Error-correcting Codes and Holographic Proofs","year":"1995","author":"spielman","key":"15"},{"key":"13","article-title":"On the block error probability of iteratively decoded LDPC codes","author":"lentmaier","year":"2004","journal-title":"2nd ITG Conference Source and Channel Coding"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/18.910588"},{"key":"11","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-1-4613-0165-3_5","article-title":"On the effective weights of pseudocodewords for codes defined on graphs with cycles","volume":"123","author":"forney jr","year":"2001","journal-title":"IMA Vol Math Appl"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"journal-title":"Decoding error-correcting codes via linear programming","year":"2003","author":"feldman","key":"3"},{"key":"2","first-page":"991","article-title":"On the relationship between linear programming decoding and min-sum algorithm decoding","author":"vontobel","year":"2004","journal-title":"Proc Int Symp Inf Theory and its Applications"},{"key":"1","first-page":"75","article-title":"Graph covers and iterative decoding of finite-length codes","author":"koetter","year":"2003","journal-title":"Proc 2nd Int Symp Turbo Codes and Related Topics Conf"},{"key":"10","article-title":"LP decoding achieves capacity","author":"feldman","year":"2005","journal-title":"Symposium on Discrete Algorithms (SODA)"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/18.887846"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365106"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"9","first-page":"70","article-title":"Lower bounds on the minimum pseudoweight of linear codes","author":"vontobel","year":"2004","journal-title":"Proc IEEE Intern Symp on Inform Theory"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405265"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","start":{"date-parts":[[2005,9,4]]},"location":"Adelaide, Australia","end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523344.pdf?arnumber=1523344","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T10:08:24Z","timestamp":1497694104000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523344\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523344","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}