{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T19:31:38Z","timestamp":1783539098908,"version":"3.55.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006817","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"1688-1692","source":"Crossref","is-referenced-by-count":5,"title":["Complexity-optimized concatenated LDGM-staircase codes"],"prefix":"10.1109","author":[{"given":"Lei M.","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank R.","family":"Kschischang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2014.2379957"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2011.2175479"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.556668"},{"key":"ref13","author":"wicker","year":"2003","journal-title":"Fundamentals of Codes Graphs and Iterative Decoding"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.826370"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.838718"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.872855"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.11.070095"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2014.2316732"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSTQE.2010.2040809"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1364\/NFOEC.2011.JWA014"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2011.6133616"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1364\/OFC.2011.OTuN2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1364\/OFC.2012.OW1H.4"},{"key":"ref7","first-page":"1","article-title":"Performance improvement of a triple-concatenated FEC by a UEP-BCH product code for 100 Gb\/s optical transport networks","author":"miyata","year":"2013","journal-title":"Optoelectronics and Communications Conf (OECC)"},{"key":"ref2","article-title":"Concatenated LDGM-staircase codes for long-haul optical-transport networks","author":"zhang","year":"2016","journal-title":"Proc 28th Biennial Symp Commun (BSC)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2017.2716373"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1364\/OFC.2013.OM2B.4"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.02.080193"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SIPS.2004.1363033"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2015.2477881"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","location":"Aachen, Germany","start":{"date-parts":[[2017,6,25]]},"end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006817.pdf?arnumber=8006817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T20:38:16Z","timestamp":1513197496000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006817\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006817","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}