{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:26:05Z","timestamp":1729628765153,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1109\/istc.2014.6955121","type":"proceedings-article","created":{"date-parts":[[2014,11,25]],"date-time":"2014-11-25T17:49:24Z","timestamp":1416937764000},"page":"238-242","source":"Crossref","is-referenced-by-count":1,"title":["An efficient complexity-optimizing LDPC code design for the binary erasure channel"],"prefix":"10.1109","author":[{"given":"Vahid","family":"Jamali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasser","family":"Karimian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Huber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmoud","family":"Ahmadian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018342"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834845"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2053874"},{"key":"1","first-page":"65","article-title":"New sequences of linear time erasure codes approaching the channel capacity","author":"shokrollahi","year":"1999","journal-title":"Proc AAECC-13"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829"},{"key":"6","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1137\/1035089","article-title":"Semi-infinite programming: Theory, methods, and applications","volume":"35","author":"hettich","year":"1993","journal-title":"SIAM Review"},{"key":"5","first-page":"277","article-title":"Low-density parity-check codes with fast decoding convergence speed","author":"ma","year":"2004","journal-title":"Proc IEEE ISIT"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.02.080193"},{"journal-title":"CVX Matlab software for disciplined convex programming version 2 0 beta","year":"2012","author":"grant","key":"9"},{"key":"8","article-title":"On the design of fast convergent ldpc codes: An optimization approach","author":"jamali","year":"2014","journal-title":"Submitted to IEEE Trans Commun"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1021\/bi00256a012"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836693"}],"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\/06955121.pdf?arnumber=6955121","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T20:55:47Z","timestamp":1498164947000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6955121\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/istc.2014.6955121","relation":{},"subject":[],"published":{"date-parts":[[2014,8]]}}}