{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T22:59:42Z","timestamp":1770332382137,"version":"3.49.0"},"reference-count":5,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3589,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s1571-0661(04)80767-9","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"89-96","source":"Crossref","is-referenced-by-count":21,"special_numbering":"C","title":["Performance of Low Density Parity Check Codes as a Function of Actual and Assumed Noise Levels"],"prefix":"10.1016","volume":"74","author":[{"given":"David J.C.","family":"MacKay","sequence":"first","affiliation":[]},{"given":"Christopher P.","family":"Hesketh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80767-9_NEWBIB1","doi-asserted-by":"crossref","unstructured":"C. Berrou, A. Glavieux, and P. Thitimajshima. Near Shannon limit error\u2013correcting coding and decoding: Turbi-codes. In Proc. 1993 IEEE International Conference on Communications, Geneva, Switzerland pages 1064\u20131070, 1993.","DOI":"10.1109\/ICC.1993.397441"},{"key":"10.1016\/S1571-0661(04)80767-9_NEWBIB2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","article-title":"Low density parity check codes","volume":"IT\u20138","author":"Gallager","year":"1962","journal-title":"IRE Trans. Info. Theory"},{"key":"10.1016\/S1571-0661(04)80767-9_NEWBIB3","series-title":"Low Density Parity check Codes","author":"Gallager","year":"1963"},{"issue":"2","key":"10.1016\/S1571-0661(04)80767-9_NEWBIB4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/18.748992","article-title":"Good error correcting codes based on very sparse matrices","volume":"45","author":"MacKay","year":"1999","journal-title":"IEEE Transactioans on Information Theory"},{"issue":"18","key":"10.1016\/S1571-0661(04)80767-9_NEWBIB5","doi-asserted-by":"crossref","first-page":"1645","DOI":"10.1049\/el:19961141","article-title":"Near Shannon limit performance of low density parity check code","volume":"32","author":"MacKay","year":"1996","journal-title":"Electronics Letters"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807679?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807679?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T05:54:04Z","timestamp":1549173244000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104807679"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":5,"alternative-id":["S1571066104807679"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80767-9","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}