{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T00:01:18Z","timestamp":1755993678029,"version":"3.44.0"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"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":[[2014,8]]},"DOI":"10.1109\/istc.2014.6955113","type":"proceedings-article","created":{"date-parts":[[2014,11,25]],"date-time":"2014-11-25T17:49:24Z","timestamp":1416937764000},"page":"198-202","source":"Crossref","is-referenced-by-count":2,"title":["Estimation of the decoding threshold of LDPC codes over the q-ary partial erasure channel"],"prefix":"10.1109","author":[{"given":"Rami","family":"Cohen","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering Technion - Israel Institute of Technology Technion City, Haifa 3200000, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Cassuto","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering Technion - Israel Institute of Technology Technion City, Haifa 3200000, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity Check Codes"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875203"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"year":"0","author":"ieee standards association","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862080"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20050230"},{"key":"11","article-title":"Open problems in additive combinatorics","author":"croot","year":"2011","journal-title":"Department of Mathematics"},{"key":"12","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/3-540-46796-3_7","article-title":"New sequences of linear time erasure codes approaching the channel capacity","volume":"1719","author":"shokrollahi","year":"1999","journal-title":"Applied Algebra Algebraic Algorithms and Error-Correcting Codes"}],"event":{"name":"2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","start":{"date-parts":[[2014,8,18]]},"location":"Bremen, Germany","end":{"date-parts":[[2014,8,22]]}},"container-title":["2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6945526\/6955070\/06955113.pdf?arnumber=6955113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:23:16Z","timestamp":1755908596000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6955113\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/istc.2014.6955113","relation":{},"subject":[],"published":{"date-parts":[[2014,8]]}}}