{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T04:09:18Z","timestamp":1776398958140,"version":"3.51.2"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T00:00:00Z","timestamp":1154390400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2006,8]]},"DOI":"10.1109\/tit.2006.878176","type":"journal-article","created":{"date-parts":[[2006,7,26]],"date-time":"2006-07-26T15:39:29Z","timestamp":1153928369000},"page":"3746-3756","source":"Crossref","is-referenced-by-count":153,"title":["Iterative Soft-Input Soft-Output Decoding of Reed\u2013Solomon Codes by Adapting the Parity-Check Matrix"],"prefix":"10.1109","volume":"52","author":[{"given":"J.","family":"Jiang","sequence":"first","affiliation":[]},{"given":"K.R.","family":"Narayanan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","article-title":"Bounds on the average binary minimum distance and the maximum likelihood performance of Reed-Solomon codes","author":"khamy","year":"2004","journal-title":"Proc Allerton"},{"key":"ref32","author":"divsalar","year":"1999","journal-title":"A simple tight bound on error probability of block codes with application to turbo codes"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1109\/18.995649","article-title":"The average weight-distance enumerator for binary expansions of Reed-Solomon codes","volume":"48","author":"retter","year":"2002","journal-title":"IEEE Trans Inf Theory"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2006.877972"},{"key":"ref35","article-title":"Iterative biased reliability-based decoding of binary linear codes","author":"jin","year":"2005","journal-title":"Proc IEICE and SITA Joint Conf Information Theory"},{"key":"ref34","author":"dolinar","year":"1998","journal-title":"Code Performance as a Function of Block Size TMO Progress Report"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.412683"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887478"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.814212"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.832754"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.485714"},{"key":"ref15","article-title":"Iterative soft decoding of Reed-Solomon codes","author":"ungerboeck","year":"2003","journal-title":"Proc Int Symp Turbo Codes and Related Topics"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.827977"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365296"},{"key":"ref18","article-title":"Generating code representations suitable for belief propagation decoding","author":"yedidia","year":"2002","journal-title":"Proc Allerton Conf Communication Control and Computing"},{"key":"ref19","author":"lin","year":"1983","journal-title":"Error Control Coding Fundamentals and Applications"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.819332"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2004.1399514"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/4234.922762"},{"key":"ref27","first-page":"1456","article-title":"Iterative algebraic soft decision decoding of Reed-Solomon codes","author":"khamy","year":"2004","journal-title":"Proc Int Symp Information Theory and Its Applications"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856939"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365456"},{"key":"ref29","author":"wicker","year":"1995","journal-title":"Error Control Systems for Digital Communication and Storage"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/26.79287"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1023\/B:VLSI.0000047274.68702.8d"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054746"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2002.805279"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053873"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/49.661116"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1109\/TIT.1983.1056724","article-title":"Decoding by local optimization","volume":"it 29","author":"farrell","year":"1983","journal-title":"IEEE Trans Inf Theory"},{"key":"ref24","article-title":"Coding for two noisy channels","author":"elias","year":"1955","journal-title":"Information Theory 3rd London Symp"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/49.661103"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/49.924874"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805089"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/34775\/01661852.pdf?arnumber=1661852","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:08Z","timestamp":1638218828000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1661852\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8]]},"references-count":35,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2006.878176","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2006,8]]}}}