{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T16:05:45Z","timestamp":1776528345049,"version":"3.51.2"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2015,2,1]],"date-time":"2015-02-01T00:00:00Z","timestamp":1422748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2015,2,1]],"date-time":"2015-02-01T00:00:00Z","timestamp":1422748800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2015,2,1]],"date-time":"2015-02-01T00:00:00Z","timestamp":1422748800000},"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":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1109\/tcomm.2014.2385858","type":"journal-article","created":{"date-parts":[[2014,12,24]],"date-time":"2014-12-24T14:44:47Z","timestamp":1419432287000},"page":"351-363","source":"Crossref","is-referenced-by-count":5,"title":["On the Design of Fast Convergent LDPC Codes for the BEC: An Optimization Approach"],"prefix":"10.1109","volume":"63","author":[{"given":"Vahid","family":"Jamali","sequence":"first","affiliation":[{"name":"Inst. for Digital Commun., FriedrichAlexander-Univ. Erlangen-Nurnberg (FAU), Erlangen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasser","family":"Karimian","sequence":"additional","affiliation":[{"name":"Dept. of Commun., K.N. Toosi Univ. of Technol., Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Huber","sequence":"additional","affiliation":[{"name":"Inst. for Inf. Transm., FriedrichAlexander-Univ. Erlangen-Nurnberg (FAU), Erlangen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmoud Ahmadian","family":"Attari","sequence":"additional","affiliation":[{"name":"Dept. of Commun., K.N. Toosi Univ. of Technol., Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6163054"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2001.935864"},{"key":"ref12","author":"khandekar","year":"2002","journal-title":"Graph-based codes and iterative decoding"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018342"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828101"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850079"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.02.080193"},{"key":"ref17","first-page":"277","article-title":"Low-density parity-check codes with fast decoding convergence speed","author":"ma","year":"0","journal-title":"Proc IEEE ISIT"},{"key":"ref18","first-page":"380","article-title":"Semi-infinite programming: Theory, methods, and applications","volume":"35","author":"hettich","year":"1993","journal-title":"Soc Ind Appl Math Rev"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-1-4757-2868-2_7","volume":"35","author":"reemtsen","year":"1998","journal-title":"Numerical methods for semi-infinite programming A survey"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2053874"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref27","first-page":"65","article-title":"New sequences of linear time erasure codes approaching the channel capacity","author":"shokrollahi","year":"0","journal-title":"13th AAECC Proc"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.805067"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834845"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089360"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.01.070451"},{"key":"ref2","first-page":"153","volume":"123","author":"shokrollahi","year":"2000","journal-title":"Capacity-Achieving Sequences"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2011.0915"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1021\/bi00256a012"},{"key":"ref22","author":"johnson","year":"2010","journal-title":"Iterative Error Correction Turbo Low-Density Parity-Check and Repeat-Accumulate Codes"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836693"},{"key":"ref24","author":"grant","year":"2012","journal-title":"CVX Matlab software for disciplined convex programming version 2 0 beta"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/7041264\/06998058.pdf?arnumber=6998058","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T05:46:39Z","timestamp":1769492799000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6998058\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2]]},"references-count":28,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2014.2385858","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2]]}}}