{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:46:35Z","timestamp":1730274395057,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437588","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"1161-1165","source":"Crossref","is-referenced-by-count":3,"title":["Improved Redundant Parity-Check Based BP Decoding of LDPC Codes"],"prefix":"10.1109","author":[{"given":"Irina E.","family":"Bocharova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris D.","family":"Kudryashov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Skachek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yauhen","family":"Yakimenka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/978-3-319-66278-7_5","article-title":"Distance properties of short LDPC codes and their impact on the BP, ML and near - ML decoding performance","author":"bocharova","year":"2017","journal-title":"3rd International Castle Meeting on Coding Theory and Applications"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133087"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2496213"},{"key":"ref6","first-page":"447","article-title":"Generating code representations suitable for belief propagation decoding","volume":"40","author":"yedidia","year":"2002","journal-title":"Proc of the Annual Allerton Conference on Communication Control and Computing"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006637"},{"journal-title":"Stopping Redundancy Hierarchy Beyond the Minimum Distance","year":"2018","author":"yakimenka","key":"ref5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006550"},{"key":"ref8","first-page":"1","article-title":"Improved iterative decoding of LDPC codes from the IEEE WiMAX standard","author":"hehn","year":"2010","journal-title":"Int Conf Source Channel Coding (SCC)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.853321"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917624"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864441"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437588.pdf?arnumber=8437588","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T20:43:24Z","timestamp":1598215404000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437588\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437588","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}