{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T21:39:29Z","timestamp":1773437969204,"version":"3.50.1"},"reference-count":9,"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)80768-0","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"97-104","source":"Crossref","is-referenced-by-count":210,"special_numbering":"C","title":["Weaknesses of Margulis and Ramanujan-Margulis Low-Density Parity-Check Codes"],"prefix":"10.1016","volume":"74","author":[{"given":"David J.C.","family":"MacKay","sequence":"first","affiliation":[]},{"given":"Michael S.","family":"Postol","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80768-0_NEWBIB1","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1109\/49.924874","article-title":"Iterative reliability-based decoding of low-density parity check codes","volume":"JSAC\u201319","author":"Fossorier","year":"2001","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"10.1016\/S1571-0661(04)80768-0_NEWBIB2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","article-title":"Low density parity check codes","volume":"IT-8","author":"Gallager","year":"1962","journal-title":"IRE Trans. Info. Theory"},{"key":"10.1016\/S1571-0661(04)80768-0_NEWBIB3","unstructured":"Lafferty J., and Rockmore D. (2000) Codes and iterative decoding on algebraic expander graphs. In International Symposium on Information Theory and its Applications."},{"key":"10.1016\/S1571-0661(04)80768-0_NEWBIB4","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1109\/26.848552","article-title":"Iterative decoding of one-step majority logic decodable codes based on belief propagation","volume":"48","author":"Lucas","year":"2000","journal-title":"IEEE Transactions on Communications"},{"issue":"2","key":"10.1016\/S1571-0661(04)80768-0_NEWBIB5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/18.748992","article-title":"Good error correcting codes based on very sparse matrives","volume":"45","author":"MacKay","year":"1999","journal-title":"IEEE Transactions on Information Theory"},{"issue":"18","key":"10.1016\/S1571-0661(04)80768-0_NEWBIB6","doi-asserted-by":"crossref","first-page":"1645","DOI":"10.1049\/el:19961141","article-title":"Near Shannon limit performance of low density parity check codes","volume":"32","author":"MacKay","year":"1996","journal-title":"Electronics Letters"},{"key":"10.1016\/S1571-0661(04)80768-0_NEWBIB7","unstructured":"Mao Y., and Banihashemi A. (2000) Design of good LDPC codes using girth distribution. In IEEE International Symposium on Information Theory Italy, June, 2000."},{"issue":"1","key":"10.1016\/S1571-0661(04)80768-0_NEWBIB8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02579283","article-title":"Explicit constructions of graphs without short cycles and low-density codes","volume":"2","author":"Margulis","year":"1982","journal-title":"Combinatorica"},{"key":"10.1016\/S1571-0661(04)80768-0_NEWBIB9","unstructured":"Rosenthal J., and Vontobel, P. O. (2000) Constructions of LDPC codes using Ramanujan graphs and ideas from Margulis. In Proceedings of the 38th Annual Allerton Conference on Communication, Control, and Computing, pp. 248\u2013257."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807680?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807680?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T10:54:03Z","timestamp":1549191243000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104807680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":9,"alternative-id":["S1571066104807680"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80768-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}