{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:45:20Z","timestamp":1720640720484},"reference-count":10,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s1571-0653(04)00195-7","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T13:34:04Z","timestamp":1113053644000},"page":"433-443","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Performance Limits of Compound Codes with Symbol-Based Iterative Decoding"],"prefix":"10.1016","volume":"6","author":[{"given":"H.","family":"Sawaya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Vialle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Boutros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Z\u00e9mor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00195-7_NEWBIB1","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TIT.1974.1055186","article-title":"Optimal decoding of linear codes for minimizing symbol error rate","volume":"20","author":"Bahl","year":"1974","journal-title":"IEEE Trans. on Inf. Theory"},{"key":"10.1016\/S1571-0653(04)00195-7_NEWBIB2","doi-asserted-by":"crossref","unstructured":"C. Berrou, A. Glavieux, P. Thitimajshima: \u201cNear Shannon Limit Error-Correcting Coding and Decoding: Turbo-Codes,\u201d proceedings of the International Conference on Communications, Gen\u00e8ve, May 1993.","DOI":"10.1109\/ICC.1993.397441"},{"key":"10.1016\/S1571-0653(04)00195-7_NEWBIB3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1109\/4234.798019","article-title":"Symbol-based Turbo codes","volume":"3","author":"Bingeman","year":"1999","journal-title":"IEEE Commun. Lett"},{"issue":"6","key":"10.1016\/S1571-0653(04)00195-7_NEWBIB4","article-title":"Zigangirov: \u201cTime-varying periodic convolutional codes with low-density parity-check matrix\u201d","volume":"45","author":"Felstrom","year":"1999","journal-title":"IEEE Trans. on Inf. Theory"},{"key":"10.1016\/S1571-0653(04)00195-7_NEWBIB5","doi-asserted-by":"crossref","unstructured":"Gallager, R.G. Low-density parity-check codes, MIT Press, 1963.","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"10.1016\/S1571-0653(04)00195-7_NEWBIB6","first-page":"219","article-title":"Iterative decoding of compound codes by probability propagation in graphical models","volume":"16","author":"Kschischang","year":"1998","journal-title":"IEEE J-SAC"},{"key":"10.1016\/S1571-0653(04)00195-7_NEWBIB7","doi-asserted-by":"crossref","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 Trans. on Inf. Theory"},{"key":"10.1016\/S1571-0653(04)00195-7_NEWBIB8","unstructured":"T. Richardson, R. Urbanke: \u201cThe capacity of low-density parity check codes under message-passing decoding\u201d, Bell Labs report, November 1998."},{"key":"10.1016\/S1571-0653(04)00195-7_NEWBIB9","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.1981.1056404","article-title":"A recursive approach to low complexity codes","volume":"27","author":"Tanner","year":"1981","journal-title":"IEEE Trans. on Information Theory"},{"key":"10.1016\/S1571-0653(04)00195-7_NEWBIB10","unstructured":"S. Vialle, J. Boutros: \u201cPerformance limits of Concatenanted Codes with Iterative Decoding,\u201d International Symposium on Information theory, ISIT2000, Sorrento, Italy, June 2000."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304001957?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304001957?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T18:53:27Z","timestamp":1586199207000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304001957"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":10,"alternative-id":["S1571065304001957"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00195-7","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}