{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:16:48Z","timestamp":1729653408645,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033990","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"2383-2387","source":"Crossref","is-referenced-by-count":2,"title":["Decimation-enhanced finite alphabet iterative decoders for LDPC codes on the BSC"],"prefix":"10.1109","author":[{"given":"Shiva Kumar","family":"Planjery","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bane","family":"Vasic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Declercq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.910588"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926319"},{"key":"ref12","article-title":"Finite alphabet iterative decoding (FAID) of the (155, 64,20) Tanner code","author":"declercq","year":"2010","journal-title":"Proc 6th Intern Symp Turbo Codes (ISTC)"},{"key":"ref13","article-title":"Solving constraint satisfaction problems through belief propagation-guided decimation","author":"montanari","year":"2007","journal-title":"Proc Allerton Conf on Commun"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2023735"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313079"},{"journal-title":"Codes and decoding on general graphs","year":"1996","author":"wiberg","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"article-title":"Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Code","year":"0","author":"vontobel","key":"ref6"},{"key":"ref5","first-page":"599","article-title":"Pseudocodewords of Tanner graphs","volume":"53","author":"kelly","year":"2001","journal-title":"IEEE Trans Inf Theory"},{"key":"ref8","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annual Allerton Conf on Commun Control and Computing"},{"key":"ref7","first-page":"1570","article-title":"Finite-length analysis of low-density parity-check codes on the binary erasure channel","volume":"it48","author":"di","year":"2002","journal-title":"IEEE Trans on Inform Theory"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"},{"key":"ref1","first-page":"769","article-title":"Multilevel decoders surpassing belief propagation on the binary symmetric chan-nel","author":"planjery","year":"2010","journal-title":"Proc Int Symp on Inform Theory"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1109\/ITW.2004.1405303","article-title":"Instanton method of posterror-correction analytical evaluation","author":"chernyak","year":"2004","journal-title":"Proc IEEE Inform Theory Workshop"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06033990.pdf?arnumber=6033990","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:18:48Z","timestamp":1560730728000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033990\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033990","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}