{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:02:52Z","timestamp":1761663772106,"version":"3.37.3"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2016R1A2A1A05005023"],"award-info":[{"award-number":["2016R1A2A1A05005023"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010418","name":"Institute for Information and communications Technology Promotion","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]},{"name":"MSIT of the Korea government","award":["2018(2016-0-00123)"],"award-info":[{"award-number":["2018(2016-0-00123)"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/tcomm.2018.2849076","type":"journal-article","created":{"date-parts":[[2018,6,19]],"date-time":"2018-06-19T18:46:08Z","timestamp":1529433968000},"page":"5028-5040","source":"Crossref","is-referenced-by-count":2,"title":["Design of Nonbinary LDPC Codes Based on Message-Passing Algorithms"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4545-1289","authenticated-orcid":false,"given":"Sunghye","family":"Cho","sequence":"first","affiliation":[]},{"given":"Kyungwhoon","family":"Cheun","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8303-2304","authenticated-orcid":false,"given":"Kyeongcheol","family":"Yang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.100912.120503"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860472"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.894088"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.060527"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.122113.130465"},{"key":"ref16","first-page":"1","article-title":"On the complexity of cycle enumeration using zeons","author":"schott","year":"2010","journal-title":"Applied Geometrical Algebras in Computer Science and Engineering"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1983-2","author":"mceliece","year":"1987","journal-title":"Finite Fields for Computer Scientist and Engineers"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.254892"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.05.070096"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1049\/el:19961141"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref6","first-page":"1426","article-title":"Error floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annu Allerton Conf Commun Control Comput"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2279831"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851753"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2403856"},{"key":"ref21","first-page":"9","article-title":"Monte Carlo simulations of infinite low density parity check codes over GF(\n$q$\n)","author":"davey","year":"1998","journal-title":"Proc Int Workshop on Optimal Codes and related Topics (OC 98)"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/8536744\/08388219.pdf?arnumber=8388219","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T21:10:41Z","timestamp":1643231441000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8388219\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":21,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2018.2849076","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2018,11]]}}}