{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,19]],"date-time":"2026-08-19T19:23:49Z","timestamp":1787167429035,"version":"build-2736575974"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"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,3]]},"DOI":"10.1109\/tcomm.2019.2962397","type":"journal-article","created":{"date-parts":[[2019,12,25]],"date-time":"2019-12-25T15:47:41Z","timestamp":1577288861000},"page":"1378-1390","source":"Crossref","is-referenced-by-count":16,"title":["Counting Short Cycles in Bipartite Graphs: A Fast Technique\/Algorithm and a Hardness Result"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1543-1124","authenticated-orcid":false,"given":"Ali","family":"Dehghan","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\/TIT.2018.2799627"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2251395"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2805906"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.020212.112311"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.100912.120503"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703427203"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282488"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2784839"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2895356"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2018.8625355"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.06.070048"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860472"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2205663"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110150"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2334657"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.122112.110805"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2613113"},{"key":"ref1","first-page":"41","article-title":"A heuristic search for good low-density parity-check codes at short block lengths","volume":"1","author":"mao","year":"2002","journal-title":"Proc IEEE Int Conf Commun Conf Rec"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480194274133"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"ref21","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90052-5"},{"key":"ref23","first-page":"29","article-title":"Extremal problems in graph theory","author":"erd?s","year":"1964","journal-title":"Theory Graphs Appl (Proc Sympos Smolenice) Publishing House Czechoslovak Acad Sci Prague Czech Republic"},{"key":"ref25","author":"d j mackay","year":"2019","journal-title":"Encyclopedia of Sparse Graph Codes"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9039763\/08943145.pdf?arnumber=8943145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T09:47:09Z","timestamp":1651052829000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8943145\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":25,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2019.2962397","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3]]}}}