{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:57:43Z","timestamp":1773377863840,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849566","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1082-1086","source":"Crossref","is-referenced-by-count":3,"title":["Iterative Decoding of Reed-Solomon Codes based on Non-binary Matrices"],"prefix":"10.1109","author":[{"given":"V. B.","family":"Wijekoon","sequence":"first","affiliation":[{"name":"Monash University, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoang","family":"Dau","sequence":"additional","affiliation":[{"name":"Monash University, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emanuele","family":"Viterbo","sequence":"additional","affiliation":[{"name":"Monash University, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"A survey on trapping sets and stopping sets","author":"price","year":"2017"},{"key":"ref11","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.24138\/jcomss.v2i3.283"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2009.2016621"},{"key":"ref14","article-title":"Mulitiple-bases belief-propagation for decoding of short block codes","author":"hehn","year":"2007","journal-title":"Proc of IEEE ISIT"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313063"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282989"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437844"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.122113.130465"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878176"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.819332"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2870437"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849566.pdf?arnumber=8849566","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:24Z","timestamp":1773347724000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849566\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849566","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}