{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:56:28Z","timestamp":1729648588759,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006637","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"794-798","source":"Crossref","is-referenced-by-count":7,"title":["Performance of ML decoding for ensembles of binary and nonbinary regular LDPC codes of finite lengths"],"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"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006550"},{"journal-title":"Performance of optimal codes at finite length","year":"2006","author":"boutros","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2496213"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828093"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.971744"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034273"},{"key":"ref16","first-page":"42","article-title":"A simple tight bound on error probability of block codes with application to turbo codes","volume":"19","author":"divsalar","year":"1999","journal-title":"TMO Progress Report"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0165-3_11"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.820746"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.335935"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1959.tb03905.x"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2008.224"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2316215"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/4234.831034"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1561\/9781933019796","author":"sason","year":"2006","journal-title":"Performance Analysis of Linear Codes Under Maximum-Likelihood Decoding A Tutorial"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E94.A.1106"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006637.pdf?arnumber=8006637","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T14:59:07Z","timestamp":1602860347000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006637\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006637","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}