{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T18:47:35Z","timestamp":1769194055183,"version":"3.49.0"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1109\/tcomm.2017.2787989","type":"journal-article","created":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T19:10:53Z","timestamp":1514574653000},"page":"1845-1858","source":"Crossref","is-referenced-by-count":19,"title":["PEG-Like Design of Binary QC-LDPC Codes Based on Detecting and Avoiding Generating Small Cycles"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8934-1981","authenticated-orcid":false,"given":"Xuan","family":"He","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9453-3734","authenticated-orcid":false,"given":"Liang","family":"Zhou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4707-8027","authenticated-orcid":false,"given":"Junyi","family":"Du","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","first-page":"1426","article-title":"Error floor of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annu Allerton Conf Commun Control Comput"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2579641"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2008.071457"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2753805"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282414"},{"key":"ref37","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.114"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.833048"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2007.061650"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2015.2494581"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110150"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.030712.110086"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.101210.090757"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.011114.130285"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2251395"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2523979"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2617335"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.030114.132853"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2250574"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2015.7308964"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2011.092911.111520"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899516"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2339329"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887082"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691248"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2608938"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.010214.132463"},{"key":"ref1","author":"he","year":"2016","journal-title":"The new multi-edge metric-constrained PEG\/QC-PEG algorithms for designing the binary LDPC codes with better cycle-structures"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2342735"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2176717"},{"key":"ref24","first-page":"1846","article-title":"Structured LDPC codes with low error floor based on PEG tanner graphs","author":"lin","year":"2008","journal-title":"Proc IEEE Int Symp Circuits Syst"},{"key":"ref23","first-page":"1990","article-title":"A class of good quasi-cyclic low-density parity check codes based on progressive edge growth graph","author":"li","year":"2004","journal-title":"Proc 38th Asilomar Conf Signals Syst Comput"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2016.7593094"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.050658"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/8359223\/08241708.pdf?arnumber=8241708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:22:38Z","timestamp":1642004558000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8241708\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":38,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2017.2787989","relation":{},"ISSN":["0090-6778"],"issn-type":[{"value":"0090-6778","type":"print"}],"subject":[],"published":{"date-parts":[[2018,5]]}}}