{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:19:38Z","timestamp":1761293978887,"version":"3.37.3"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Munich Aerospace e.V., grant \u201cEfficient Coding and Modulation for Satellite Links with Severe Delay Constraints\u201d"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1109\/lcomm.2019.2937773","type":"journal-article","created":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T20:07:45Z","timestamp":1566936465000},"page":"1972-1976","source":"Crossref","is-referenced-by-count":6,"title":["Successive Cancellation List Decoding of Product Codes With Reed-Muller Component Codes"],"prefix":"10.1109","volume":"23","author":[{"given":"Mustafa Cemil","family":"Coskun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7538-7639","authenticated-orcid":false,"given":"Thomas","family":"Jerkovits","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8657-2963","authenticated-orcid":false,"given":"Gianluigi","family":"Liva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.826632"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864443"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"article-title":"Rekursive codes mit der Plotkin-Konstruktion und ihre decodierung","year":"2002","author":"stolte","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2004.837405"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ECWT.2005.1617639"},{"key":"ref16","first-page":"1","article-title":"Channel coding for IEEE 802.16e mobile WiMAX","author":"valenti","year":"2009","journal-title":"Proc Tuts IEEE Int Conf Commun (ICC)"},{"year":"0","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.phycom.2019.03.004"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856937"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1968.1089859"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053730"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/26.705396"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2816073"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313083"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IREPGELC.1954.6499441"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2673829"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057464"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620368"},{"key":"ref22","first-page":"1763","article-title":"Successive cancellation decoding of single parity-check product codes","author":"co?kun","year":"2017","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2019.8886100"},{"key":"ref24","first-page":"1","article-title":"Low-complexity joint channel estimation and list decoding of short codes","author":"co?kun","year":"2019","journal-title":"Proc SSC 12th Int ITG Conf Syst Commun Coding"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/WIRLES.2005.1549650"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CTMC.1994.512606"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/8894905\/08815922.pdf?arnumber=8815922","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:52:45Z","timestamp":1657745565000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8815922\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":28,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2019.2937773","relation":{},"ISSN":["1089-7798","1558-2558","2373-7891"],"issn-type":[{"type":"print","value":"1089-7798"},{"type":"electronic","value":"1558-2558"},{"type":"electronic","value":"2373-7891"}],"subject":[],"published":{"date-parts":[[2019,11]]}}}