{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T16:14:46Z","timestamp":1787760886066,"version":"build-2784847793"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["217239-2013-RGPIN"],"award-info":[{"award-number":["217239-2013-RGPIN"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1109\/tcomm.2019.2953601","type":"journal-article","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T22:52:25Z","timestamp":1573771945000},"page":"697-712","source":"Crossref","is-referenced-by-count":20,"title":["Construction of QC LDPC Codes With Low Error Floor by Efficient Systematic Search and Elimination of Trapping Sets"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1577-3391","authenticated-orcid":false,"given":"Bashirreza","family":"Karimi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0685-5256","authenticated-orcid":false,"given":"Amir H.","family":"Banihashemi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2679707"},{"key":"ref11","article-title":"Efficient search of QC-LDPC codes with girths 6 and 8 and free of elementary trapping sets with small size","author":"amirzade","year":"2018","journal-title":"arXiv 1803 08141"},{"key":"ref12","article-title":"Edge coloring technique to remove small elementary trapping sets from Tanner graph of QC-LDPC codes with column weight 4","author":"sadeghi","year":"2018","journal-title":"arXiv 1808 05258"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2613113"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2799627"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2205663"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034781"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048448"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2708088"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437485"},{"key":"ref28","article-title":"Advanced design of binary LDPC codes for practical applications","author":"diouf","year":"2015"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110150"},{"key":"ref27","first-page":"365","article-title":"A class of group-structured LDPC codes","author":"tanner","year":"2001","journal-title":"Int Symp Commun Theory Appl"},{"key":"ref3","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 Asilomar Conf Signal Syst Comput"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173733"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2608938"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.030712.110086"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2235122"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.060112.120844"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.839612"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282621"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2523979"},{"key":"ref22","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","author":"vizing","year":"1964","journal-title":"Diskret Analiz"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.06.0700712"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00446-5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.836563"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.083110.080638"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/8999755\/08901173.pdf?arnumber=8901173","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T13:47:22Z","timestamp":1651067242000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8901173\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2]]},"references-count":29,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2019.2953601","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2]]}}}