{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:15:57Z","timestamp":1761581757588,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1109\/ita.2018.8503226","type":"proceedings-article","created":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T23:42:52Z","timestamp":1540510972000},"page":"1-10","source":"Crossref","is-referenced-by-count":12,"title":["Reed-Solomon-Based Quasi-Cyclic LDPC Codes: Designs, Cycle Structure and Erasure Correction"],"prefix":"10.1109","author":[{"given":"Xin","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William E.","family":"Ryan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bane","family":"Vasic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shu","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khaled","family":"Abdel-Ghaffar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","article-title":"Reed-Solomon based nonbianry LDPC codes: correction of random errors and bursts of erasures","author":"li","year":"2017","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2508455"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1109\/26.990903","article-title":"Near optimum universal belief propagation based decoding of low-density parity-check codes","volume":"50","author":"chen","year":"2002","journal-title":"IEEE Trans Inf Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/9781316780152"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2339329"},{"key":"ref8","first-page":"1","article-title":"A transform approach for analyzing and constructing quasi-cyclic low-density parity-check codes","author":"diao","year":"2011","journal-title":"Proc Inf Theory Applic Workshop"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref2","article-title":"A scheme for encoding and iterative soft-decision decoding of cyclic codes of prime lengths: Applications to Reed-Solomon, BCH, and quadratic residue codes","author":"lin","year":"2016","journal-title":"IEEE Trans Inf Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184834"},{"key":"ref1","article-title":"Iterative soft decision decoding of Reed-Solomon codes","author":"lin","year":"2017","journal-title":"Proc IEEE Int Symp Inf Theory"}],"event":{"name":"2018 Information Theory and Applications Workshop (ITA)","start":{"date-parts":[[2018,2,11]]},"location":"San Diego, CA","end":{"date-parts":[[2018,2,16]]}},"container-title":["2018 Information Theory and Applications Workshop (ITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8486613\/8502949\/08503226.pdf?arnumber=8503226","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T11:24:14Z","timestamp":1693999454000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8503226\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/ita.2018.8503226","relation":{},"subject":[],"published":{"date-parts":[[2018,2]]}}}