{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:51:09Z","timestamp":1725457869979},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/isit.2012.6284008","type":"proceedings-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T16:57:57Z","timestamp":1346345877000},"page":"2691-2695","source":"Crossref","is-referenced-by-count":1,"title":["Hierarchies of local-optimality characterizations in decoding Tanner codes"],"prefix":"10.1109","author":[{"given":"Nissim","family":"Halabi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Even","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454077"},{"journal-title":"Encyclopedia of Sparse Graph Codes","year":"0","author":"mackay","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102403799"},{"key":"12","first-page":"460","article-title":"LP decoding achieves capacity","author":"feldman","year":"0","journal-title":"Proc SODA'05 Vancouver Canada Jan 2005"},{"key":"3","article-title":"On decoding irregular Tanner codes with local-optimality guarantees","author":"even","year":"2011","journal-title":"CoRR"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536418"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/18.910585"},{"key":"6","article-title":"Exact inference using the attenuated max-product algorithm","author":"frey","year":"2000","journal-title":"Advanced Mean Field Methods Theory and Practice"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/4234.1001666"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111730"},{"key":"8","article-title":"Convergence of weighted min-sum decoding via dynamic programming on coupled trees","author":"jian","year":"2011","journal-title":"CoRR"}],"event":{"name":"2012 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2012,7,1]]},"location":"Cambridge, MA, USA","end":{"date-parts":[[2012,7,6]]}},"container-title":["2012 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6268627\/6281806\/06284008.pdf?arnumber=6284008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T20:55:02Z","timestamp":1490129702000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6284008\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2012.6284008","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}