{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:44:17Z","timestamp":1761662657214,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1109\/isit.2008.4595167","type":"proceedings-article","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T18:33:52Z","timestamp":1218652432000},"page":"1148-1152","source":"Crossref","is-referenced-by-count":4,"title":["Efficient layers-based schedules for iterative decoding of LDPC codes"],"prefix":"10.1109","author":[{"given":"Noam","family":"Presman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eran","family":"Sharon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Litsyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","first-page":"8","article-title":"shuffled belief propagation decoding","volume":"1","author":"zhang","year":"2002","journal-title":"The Proceedings 36th Asilomar Conference on Signals Systems and Computers Pacific Grove"},{"journal-title":"Convergence Analysis of Generalized Serial Message-Passing Schedules for LDPC Decoding","year":"0","author":"sharon","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365273"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2007.061454"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2003.08.015"},{"key":"1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Paritv Check Codes"},{"key":"10","article-title":"generating good finite length ldpc codes based on lifted graphs","author":"sharon","year":"2008","journal-title":"IEEE Trans Communications"},{"journal-title":"LDPC Decoding Acheivable Rates and Convergence Rates","year":"2008","author":"presman","key":"7"},{"key":"6","article-title":"programmable vector processor for irregular ldpc codes","author":"novichkov","year":"2004","journal-title":"38th Annual Conf on Info Sciences and Systems"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2003.817545"},{"key":"4","article-title":"turbo like decoding of ldpc codes","author":"lu","year":"2003","journal-title":"IEEE International Magnetics Conference"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907507"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"}],"event":{"name":"2008 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2008,7,6]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2008,7,11]]}},"container-title":["2008 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4586217\/4594928\/04595167.pdf?arnumber=4595167","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T06:06:33Z","timestamp":1557727593000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4595167\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2008.4595167","relation":{},"subject":[],"published":{"date-parts":[[2008,7]]}}}