{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:50:27Z","timestamp":1772121027995,"version":"3.50.1"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"RGC of the Hong Kong SAR, China","award":["PolyU 152170\/18E"],"award-info":[{"award-number":["PolyU 152170\/18E"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1109\/tcomm.2021.3077939","type":"journal-article","created":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T19:40:41Z","timestamp":1620330041000},"page":"4998-5013","source":"Crossref","is-referenced-by-count":16,"title":["Protograph-Based LDPC Hadamard Codes"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7615-4653","authenticated-orcid":false,"given":"Peng-Wei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8279-0899","authenticated-orcid":false,"given":"Francis C. M.","family":"Lau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7007-6746","authenticated-orcid":false,"given":"Chiu-Wing","family":"Sham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820018"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2006.1618943"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2006.878828"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2006.877956"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094819"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.050600"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.2200\/S00017ED1V01Y200508COM002"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.890694"},{"key":"ref35","first-page":"1377","article-title":"Low-rate generalized low-density parity-check codes with Hadamard constraints","author":"yue","year":"2005","journal-title":"Proc Int Symp Inf Theory (ISIT)"},{"key":"ref34","first-page":"1","article-title":"Generalized low density parity check codes","author":"sharon","year":"2019","journal-title":"Proc 10th Annu Non-Volatile Memories Workshop"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CompComm.2018.8780906"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.826370"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref17","first-page":"201","article-title":"Coding theorems for ‘turbo-like’ codes","author":"divsalar","year":"1998","journal-title":"Proc Allerton Conf"},{"key":"ref18","first-page":"1","article-title":"Irregular repeat-accumulate codes","author":"jin","year":"2000","journal-title":"Proc 2nd Int Symp Turbo Codes"},{"key":"ref19","first-page":"1","article-title":"Low-density parity-check (LDPC) codes constructed from protographs","author":"thorpe","year":"2003","journal-title":"Proc IPN Progr Rep"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2012.6325220"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/26.539767"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1999.767979"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60693-9_13"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/11617983_24"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2893851"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2436705"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC45663.2020.9120683"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2007.616"},{"key":"ref46","doi-asserted-by":"crossref","first-page":"1773","DOI":"10.1109\/TIT.2008.917643","article-title":"EXIT functions of Hadamard components in repeat–zigzag–Hadamard (RZH) codes with parallel decoding","volume":"54","author":"li","year":"2008","journal-title":"IEEE Trans Inf Theory"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613515"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282583"},{"key":"ref47","article-title":"Protograph-based low-density parity-check Hadamard codes","author":"zhang","year":"2020","journal-title":"arXiv 2010 08285"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523619"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2453267"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2019.2960613"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2018.8625371"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2504279"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/4234.781010"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3022537"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/MVT.2019.2903343"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871613"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9512856\/09424609.pdf?arnumber=9424609","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:48:38Z","timestamp":1652194118000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9424609\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":47,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2021.3077939","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8]]}}}