{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:28:16Z","timestamp":1648772896212},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"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":[[2011,10]]},"DOI":"10.1109\/tit.2011.2165813","type":"journal-article","created":{"date-parts":[[2011,10,12]],"date-time":"2011-10-12T14:34:17Z","timestamp":1318430057000},"page":"6754-6770","source":"Crossref","is-referenced-by-count":11,"title":["Analysis of Verification-Based Decoding on the $q$-ary Symmetric Channel for Large $q$"],"prefix":"10.1109","volume":"57","author":[{"given":"Fan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henry D.","family":"Pfister","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/26.891211"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"ref12","first-page":"97","article-title":"Decoding of interleaved Reed-Solomon codes over noisy data","author":"bleichenbacher","year":"2003","journal-title":"Proc ICALP"},{"key":"ref13","first-page":"275","article-title":"Low-density parity-check codes with rates very close to the capacity of the <formula formulatype=\"inline\"><tex Notation=\"TeX\">$q$<\/tex> <\/formula>-ary symmetric channel for large <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$q$<\/tex><\/formula>","author":"shokrollahi","year":"2004","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref14","first-page":"275","article-title":"Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the <formula formulatype=\"inline\"><tex Notation=\"TeX\">$q$<\/tex> <\/formula>-ary Symmetric Channel for Large <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$q$<\/tex><\/formula>","author":"shokrollahi","year":"2004","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780562"},{"key":"ref17","author":"zhang","year":"0","journal-title":"On the stopping sets of verification decoding"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004612"},{"key":"ref19","author":"zhang","year":"0","journal-title":"Software to Compute the LM2-NB Threshold"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref6","article-title":"Coding for the <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$q$<\/tex><\/formula>-ary symmetric channel with moderate <formula formulatype=\"inline\"><tex Notation=\"TeX\">$q$<\/tex><\/formula>","author":"weidmann","year":"2008","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1109\/ITW.2004.1405300","article-title":"Capacity-approaching codes on the <formula formulatype=\"inline\"><tex Notation=\"TeX\">$q$<\/tex><\/formula>-ary symmetric channel for large <formula formulatype=\"inline\"><tex Notation=\"TeX\">$q$<\/tex> <\/formula>","author":"shokrollahi","year":"2004","journal-title":"Proc IEEE Inf Theory Workshop"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839499"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1109\/TURBOCODING.2008.4658701","article-title":"Optimization of binary ldpc codes for the <formula formulatype=\"inline\"><tex Notation=\"TeX\">$q$<\/tex> <\/formula>-ary symmetric channel with moderate <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$q$<\/tex><\/formula>","author":"lechner","year":"2008","journal-title":"Proc 5th Int Symp Turbo Codes and Related Topics"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/3-540-60693-9_13","article-title":"Good codes based on very sparse matrices","volume":"1025","author":"mackay","year":"1995","journal-title":"Lecture Notes in Comput Sci"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/26.539759"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref20","first-page":"73","author":"wormald","year":"1999","journal-title":"Lectures on Approximation and Randomized Algorithms"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2201344"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261573"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813563"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6034704\/06034757.pdf?arnumber=6034757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:46:10Z","timestamp":1633909570000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034757\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":25,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2165813","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10]]}}}