{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T18:30:01Z","timestamp":1779906601281,"version":"3.53.1"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","award":["2011-5961"],"award-info":[{"award-number":["2011-5961"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1109\/tit.2017.2689783","type":"journal-article","created":{"date-parts":[[2017,3,30]],"date-time":"2017-03-30T20:20:27Z","timestamp":1490905227000},"page":"4357-4378","source":"Crossref","is-referenced-by-count":24,"title":["Density Evolution for Deterministic Generalized Product Codes on the Binary Erasure Channel at High Rates"],"prefix":"10.1109","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5155-8018","authenticated-orcid":false,"given":"Christian","family":"Hager","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5521-4397","authenticated-orcid":false,"given":"Henry D.","family":"Pfister","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandre","family":"Graell i Amat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4856-3422","authenticated-orcid":false,"given":"Fredrik","family":"Brannstrom","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1017\/S0963548307008589","article-title":"The k-core and branching processes","volume":"17","author":"riordan","year":"2007","journal-title":"Combinat Probab Comput"},{"key":"ref38","first-page":"15","article-title":"Random graphs and branching processes","author":"bollob\u00e1s","year":"2009","journal-title":"Handbook of Large-scale Random Networks"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282416"},{"key":"ref32","author":"jian","year":"2015","journal-title":"Approaching capacity at high-rates with iterative hard-decision decoding"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284009"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.041077"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2015.7309002"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706098"},{"key":"ref35","first-page":"290","article-title":"On random graphs I","volume":"6","author":"erd?s","year":"1959","journal-title":"Publicationes Math"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1996.0036"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1214\/07-AAP478"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513595"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205688"},{"key":"ref29","article-title":"Low-density parity-check (LDPC) codes constructed from protographs","author":"thorpe","year":"2005"},{"key":"ref2","article-title":"Concatenated codes","author":"forney","year":"1965"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056888"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018350"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404656"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20168"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059490"},{"key":"ref25","first-page":"364","article-title":"Analysis of random processes via and-or tree evaluation","author":"luby","year":"1998","journal-title":"Proc 9th Annu ACMSIAM Symp Discrete Algorithms"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095072"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2352296"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2009580"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20061"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.02.080193"},{"key":"ref56","author":"gradshteyn","year":"2007","journal-title":"Table of Integrals Series and Products"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46796-3_7"},{"key":"ref54","first-page":"236","article-title":"Density evolution for deterministic generalized product codes with higher-order modulation","author":"h\u00e4ger","year":"2016","journal-title":"Proc Int Symp Turbo Codes Iterative Inf Process (ISTC)"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1364\/OFC.2016.Th2A.42"},{"key":"ref52","first-page":"2114","article-title":"Deterministic and ensemble-based spatially-coupled product codes","author":"h\u00e4ger","year":"2016","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2010.5560589"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.121410.090146"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154"},{"key":"ref12","article-title":"Continuously-interleaved BCH (CI-BCH) FEC delivers best-in-class NECG for 40 G and 100 G metro applications","author":"scholten","year":"2010","journal-title":"Proc Opt Fiber Commun Conf (OFC)"},{"key":"ref13","first-page":"2376","article-title":"Iterative hard-decision decoding of braided BCH codes for high-speed optical communication","author":"jian","year":"2014","journal-title":"Proc IEEE Global Commun Conf (GLOBECOM)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2014.2316732"},{"key":"ref15","first-page":"1","article-title":"On parameter optimization for staircase codes","author":"h\u00e4ger","year":"2015","journal-title":"Proc Opt Fiber Commun Conf (OFC)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","article-title":"Low-density parity-check codes","author":"gallager","year":"1963"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523647"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057464"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1968.1089859"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2011.2175479"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.66.066121"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313069"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1142\/6300"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276756"},{"key":"ref48","article-title":"Error-correcting codes for fibre-optic communication systems","author":"smith","year":"2011"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548315000103"},{"key":"ref42","author":"karlin","year":"1975","journal-title":"A First Course in Stochastic Processes"},{"key":"ref41","volume":"1","author":"van der hofstad","year":"2014","journal-title":"Random Graphs and Complex Networks"},{"key":"ref44","author":"montanari","year":"2014","journal-title":"Statistical mechanics and algorithms on sparse and random graphs"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1214\/09-AAP627"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7948883\/07890389.pdf?arnumber=7890389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:47Z","timestamp":1641987587000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7890389\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":60,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2689783","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7]]}}}