{"id":"https://openalex.org/W4386066350","doi":"https://doi.org/10.1109/isit54713.2023.10207005","title":"On the Tanner Cycle Distribution of QC-LDPC Codes from Polynomial Parity-Check Matrices","display_name":"On the Tanner Cycle Distribution of QC-LDPC Codes from Polynomial Parity-Check Matrices","publication_year":2023,"publication_date":"2023-06-25","ids":{"openalex":"https://openalex.org/W4386066350","doi":"https://doi.org/10.1109/isit54713.2023.10207005"},"language":"en","primary_location":{"id":"doi:10.1109/isit54713.2023.10207005","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10207005","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012571757","display_name":"Anthony G\u00f3mez-Fonseca","orcid":"https://orcid.org/0000-0002-3569-9304"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anthony G\u00f3mez-Fonseca","raw_affiliation_strings":["University of Notre Dame,Department of Mathematics,Notre Dame,IN,USA,46556"],"affiliations":[{"raw_affiliation_string":"University of Notre Dame,Department of Mathematics,Notre Dame,IN,USA,46556","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061445419","display_name":"Roxana Smarandache","orcid":"https://orcid.org/0000-0001-9085-5974"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Roxana Smarandache","raw_affiliation_strings":["University of Notre Dame,Department of Mathematics,Notre Dame,IN,USA,46556","Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA"],"affiliations":[{"raw_affiliation_string":"University of Notre Dame,Department of Mathematics,Notre Dame,IN,USA,46556","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076523933","display_name":"David G. M. Mitchell","orcid":"https://orcid.org/0000-0002-3544-9225"},"institutions":[{"id":"https://openalex.org/I10052268","display_name":"New Mexico State University","ror":"https://ror.org/00hpz7z43","country_code":"US","type":"education","lineage":["https://openalex.org/I10052268"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David G. M. Mitchell","raw_affiliation_strings":["New Mexico State University,Klipsch School of Electrical and Computer Engineering,Las Cruces,NM,USA,88003"],"affiliations":[{"raw_affiliation_string":"New Mexico State University,Klipsch School of Electrical and Computer Engineering,Las Cruces,NM,USA,88003","institution_ids":["https://openalex.org/I10052268"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012571757"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11475115,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2356","last_page":"2361"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7200138568878174},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.5879952907562256},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.5554328560829163},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.500356912612915},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.49830150604248047},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4692411720752716},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45401421189308167},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37434521317481995},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.25886571407318115},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.20509293675422668},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.16542795300483704},{"id":"https://openalex.org/keywords/particle-physics","display_name":"Particle physics","score":0.07717758417129517}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7200138568878174},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.5879952907562256},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.5554328560829163},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.500356912612915},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.49830150604248047},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4692411720752716},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45401421189308167},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37434521317481995},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.25886571407318115},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.20509293675422668},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.16542795300483704},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.07717758417129517}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit54713.2023.10207005","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10207005","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W91277888","https://openalex.org/W1558273801","https://openalex.org/W1813544306","https://openalex.org/W1991921359","https://openalex.org/W2008209264","https://openalex.org/W2108136433","https://openalex.org/W2109383536","https://openalex.org/W2119017156","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2133339613","https://openalex.org/W2137874581","https://openalex.org/W2147776616","https://openalex.org/W2148317974","https://openalex.org/W2152165958","https://openalex.org/W2154297943","https://openalex.org/W2154993501","https://openalex.org/W2160065222","https://openalex.org/W2163532780","https://openalex.org/W3198725383","https://openalex.org/W4213281018","https://openalex.org/W6603727012","https://openalex.org/W6679489882"],"related_works":["https://openalex.org/W2537963609","https://openalex.org/W2092857423","https://openalex.org/W2361792238","https://openalex.org/W2954849755","https://openalex.org/W2182725540","https://openalex.org/W3126598192","https://openalex.org/W2066141615","https://openalex.org/W2090897912","https://openalex.org/W2122913048","https://openalex.org/W2796395817"],"abstract_inverted_index":{"In":[0,58],"this":[1,59],"paper,":[2],"we":[3,61],"present":[4],"an":[5],"efficient":[6],"strategy":[7,40],"to":[8,75,176],"enumerate":[9],"the":[10,20,64,68,82,91,111,118,127,131,169,177,189],"number":[11,132],"of":[12,23,67,78,113,129,133,179,192],"k-cycles,":[13,134],"g":[14,32],"\u2264":[15],"k":[16,137],"<":[17],"+2g,":[18],"in":[19,81,110],"Tanner":[21],"graph":[22],"a":[24,182],"quasi-cyclic":[25],"low-density":[26],"parity-check":[27,36],"(QC-LDPC)":[28],"code":[29],"with":[30],"girth":[31],"using":[33],"its":[34],"polynomial":[35,69],"matrix":[37,71],"H.":[38],"This":[39],"works":[41,187],"for":[42,136],"both":[43],"(n":[44],"<inf":[45,50,122],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[46,51,123],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">c</inf>":[47],",":[48],"n":[49,121],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">v</inf>":[52,124],")-regular":[53],"and":[54,84,141,155],"irregular":[55],"QC-LDPC":[56,114,193],"codes.":[57,194],"approach,":[60,175],"note":[62],"that":[63],"mth":[65],"power":[66],"adjacency":[70],"can":[72,85],"be":[73,87],"used":[74],"describe":[76],"walks":[77],"length":[79],"m":[80,105],"protograph":[83],"therefore":[86],"sufficiently":[88],"described":[89],"by":[90],"matrices":[92],"${B_m}(H)":[93],"\\triangleq":[94],"{\\left(":[95],"{H{H^":[96],"\\top":[97],"}}":[98],"\\right)^{\\left\\lfloor":[99],"{m/2}":[100],"\\right\\rfloor":[101],"}}{H^{(m\\,\\bmod":[102],"\\,2)}}$,":[103],"where":[104],"\u2265":[106],"0.":[107],"For":[108],"example,":[109],"case":[112],"codes":[115],"based":[116],"on":[117,168,188],"3":[119],"\u00d7":[120],"fully-connected":[125],"protograph,":[126],"complexity":[128],"determining":[130],"${\\mathcal{N}_k}$,":[135],"=":[138],"4,":[139],"6":[140],"8,":[142],"is":[143],"$O\\left(":[144,148,156],"{n_v^2\\log":[145,149],"(N)}":[146,153,161],"\\right)$,":[147,162],"\\left(":[150],"{{n_v}}":[151,159],"\\right)\\log":[152,160],"\\right)$":[154],"{n_v^4{{\\log":[157],"}^4}\\left(":[158],"respectively.":[163],"The":[164],"complexity,":[165],"depending":[166],"logarithmically":[167],"lifting":[170],"factor":[171],"N,":[172],"gives":[173],"our":[174,180],"best":[178],"knowledge,":[181],"significant":[183],"advantage":[184],"over":[185],"previous":[186],"cycle":[190],"distribution":[191]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}