{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:49Z","timestamp":1740131689387,"version":"3.37.3"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Singapore Ministry of Education Academic Research Fund Tier 2","award":["MOE2016-T2-2-054"],"award-info":[{"award-number":["MOE2016-T2-2-054"]}]},{"name":"Singapore Agency of Science and Technology (A*Star) PSF research grant"},{"name":"SpOT-LITE programme","award":["A18A6b0057"],"award-info":[{"award-number":["A18A6b0057"]}]},{"name":"RIE2020 funds from Singapore"},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["18K04132"],"award-info":[{"award-number":["18K04132"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1109\/tcomm.2019.2922391","type":"journal-article","created":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T19:54:16Z","timestamp":1560369256000},"page":"5963-5980","source":"Crossref","is-referenced-by-count":2,"title":["Union Bound Analysis and Code Design for Multilevel Flash Memory Channels"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1271-7300","authenticated-orcid":false,"given":"Guanghui","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2059-0071","authenticated-orcid":false,"given":"Kui","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7771-2132","authenticated-orcid":false,"given":"Jun","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.892807"},{"key":"ref32","first-page":"201","article-title":"Coding theorems for ‘Turbo-Like’ codes","author":"divsalar","year":"1998","journal-title":"Proc 36th Annu Allerton Conf Commun Control Comput"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2574869"},{"key":"ref30","article-title":"A general method for finding low error rates of LDPC codes","author":"cole","year":"2006","journal-title":"arXiv cs\/0605051"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2533498"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2015.2464092"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2603719"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2603658"},{"key":"ref14","first-page":"521","article-title":"Error patterns in MLC NAND flash memory: Measurement, characterization, and analysis","author":"cai","year":"2012","journal-title":"Proc Design Autom Test Eur Conf Exhibition (DATE)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.7873\/DATE.2013.266"},{"key":"ref16","first-page":"1","article-title":"Statistical analysis of flash memory read data","author":"moon","year":"2011","journal-title":"Proc IEEE Global Telecommun Conf"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2014.7037159"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1971.1090700"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2002.801524"},{"key":"ref4","first-page":"125","article-title":"Optimization of achievable information rates and number of levels in multilevel flash memories","author":"huang","year":"2013","journal-title":"Proc 12th Int Conf Netw (ICN)"},{"key":"ref27","first-page":"767","article-title":"On the computation of the minimum distance of low-density parity-check codes","author":"hu","year":"2004","journal-title":"Proc IEEE Int Conf Commun"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2814985"},{"key":"ref6","first-page":"1","article-title":"Soft information for LDPC decoding in flash: Mutual-information optimized quantization","author":"wang","year":"2011","journal-title":"Proc IEEE Global Telecommun Conf"},{"journal-title":"MacKay’s Gallager Code Resources","year":"2017","author":"mackay","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875236"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282826"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140508"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/0100000084"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2015.7248333"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MCE.2014.2360965"},{"article-title":"A simple tight bound on error probability of block codes with application to turbo codes","year":"1999","author":"divsalar","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996745"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.254911"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2569528"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277928"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094819"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883541"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/8839626\/08735878.pdf?arnumber=8735878","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:09:37Z","timestamp":1657746577000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8735878\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":33,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2019.2922391","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2019,9]]}}}