{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:22:07Z","timestamp":1778127727649,"version":"3.51.4"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100006245","name":"Ministry of Science and Technology, Israel","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006245","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001736","name":"German-Israeli Foundation for Scientific Research and Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001736","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1109\/tit.2016.2545679","type":"journal-article","created":{"date-parts":[[2016,3,23]],"date-time":"2016-03-23T14:18:29Z","timestamp":1458742709000},"page":"2658-2672","source":"Crossref","is-referenced-by-count":13,"title":["Iterative Decoding of LDPC Codes Over the $q$ -Ary Partial Erasure Channel"],"prefix":"10.1109","volume":"62","author":[{"given":"Rami","family":"Cohen","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Technion\u2013Israel Institute of Technology, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Cassuto","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Technion\u2013Israel Institute of Technology, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/4234.905935"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2003.808600"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862080"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20050230"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref16","first-page":"61","article-title":"Coding for two noisy channels","author":"elias","year":"1955","journal-title":"Proc Inf Theory 3rd London Symp"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755149"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref4","first-page":"246","article-title":"A 5.6 MB\/s 64 Gb 4 b\/cell NAND flash memory in 43 nm CMOS","author":"trinh","year":"2009","journal-title":"Proc IEEE Int Solid-State Circuits Conf (ISSCC)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1186\/1556-276X-9-526"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488867"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2014.6883927"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1089733.1089735"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5015-0_3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1998.2235"},{"key":"ref22","first-page":"239","article-title":"The Cauchy–Davenport theorem in group extensions","volume":"51","author":"k\u00e1rolyi","year":"2005","journal-title":"L’Enseignement Math"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1090\/crmp\/043\/10","article-title":"Open problems in additive combinatorics","author":"croot","year":"2007","journal-title":"Additive Combinatorics CRM"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10474-005-0185-z"},{"key":"ref26","article-title":"On the construction of some capacity-approaching coding schemes","author":"chung","year":"2000"},{"key":"ref25","author":"grinstead","year":"1997","journal-title":"Introduction to Probability"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7456355\/07439825.pdf?arnumber=7439825","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:53:01Z","timestamp":1755910381000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7439825\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":26,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2545679","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5]]}}}