{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T05:36:47Z","timestamp":1725428207042},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6874922","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T17:50:30Z","timestamp":1408470630000},"page":"696-700","source":"Crossref","is-referenced-by-count":2,"title":["Instanton search algorithm for the ADMM penalized decoder"],"prefix":"10.1109","author":[{"given":"Xishuo","family":"Liu","sequence":"first","affiliation":[]},{"given":"Stark C.","family":"Draper","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes","year":"2005","author":"vontobel","key":"17"},{"journal-title":"Instantons Causing Iterative Decoding to Cycle","year":"2011","author":"stepanov","key":"18"},{"key":"15","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"ICST"},{"journal-title":"Encyclopedia of Sparse Graph Codes","year":"0","author":"mackay","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033824"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2146670"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887523"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.95.228701"},{"key":"3","first-page":"367","article-title":"Suppressing pseudo code words by penalizing the objective of LP decoding","author":"liu","year":"2012","journal-title":"IEEE Inf Theory Workshop (ITW)"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281372"},{"key":"10","first-page":"1572","article-title":"The L1 penalized decoder and its reweighted LP","author":"liu","year":"2012","journal-title":"Annual Allerton Conf Communication Control and Computing"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917682"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090804"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261777"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80768-0"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2253512"},{"key":"8","article-title":"Random gradient-free minimization of convex functions","author":"nesterov","year":"2011","journal-title":"CORE Discussion paper"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2014,6,29]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06874922.pdf?arnumber=6874922","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T10:39:37Z","timestamp":1602671977000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6874922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6874922","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}