{"id":"https://openalex.org/W4415367681","doi":"https://doi.org/10.1109/isit63088.2025.11195483","title":"Construction of QC-LDPC Codes with Girth $g$ from the Hermite Normal Form of a Matrix","display_name":"Construction of QC-LDPC Codes with Girth $g$ from the Hermite Normal Form of a Matrix","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367681","doi":"https://doi.org/10.1109/isit63088.2025.11195483"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195483","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195483","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"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.37427462,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9987000226974487,"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.9987000226974487,"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.9986000061035156,"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/T11130","display_name":"Coding theory and cryptography","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/girth","display_name":"Girth (graph theory)","score":0.6133999824523926},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.6072999835014343},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.5878000259399414},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5414000153541565},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.5001000165939331},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.44359999895095825},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.4406999945640564},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3982999920845032}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.760200023651123},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.6133999824523926},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6116999983787537},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.6072999835014343},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5878000259399414},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5414000153541565},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.5001000165939331},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4530999958515167},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.44359999895095825},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.4406999945640564},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3982999920845032},{"id":"https://openalex.org/C18912844","wikidata":"https://www.wikidata.org/wiki/Q4724001","display_name":"Algebraic expression","level":3,"score":0.3343000113964081},{"id":"https://openalex.org/C201362023","wikidata":"https://www.wikidata.org/wiki/Q658574","display_name":"Hermite polynomials","level":2,"score":0.3337000012397766},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.32420000433921814},{"id":"https://openalex.org/C85817219","wikidata":"https://www.wikidata.org/wiki/Q884772","display_name":"Block matrix","level":3,"score":0.3179999887943268},{"id":"https://openalex.org/C182419690","wikidata":"https://www.wikidata.org/wiki/Q205464","display_name":"Algebraic structure","level":2,"score":0.31630000472068787},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3093000054359436},{"id":"https://openalex.org/C2988995629","wikidata":"https://www.wikidata.org/wiki/Q2915729","display_name":"Matrix algebra","level":3,"score":0.3077999949455261},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.2526000142097473},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195483","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195483","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1673950838","https://openalex.org/W1813544306","https://openalex.org/W1973712217","https://openalex.org/W2008209264","https://openalex.org/W2071304218","https://openalex.org/W2108136433","https://openalex.org/W2119017156","https://openalex.org/W2119604283","https://openalex.org/W2128765501","https://openalex.org/W2132161120","https://openalex.org/W2133068391","https://openalex.org/W2137874581","https://openalex.org/W2141836583","https://openalex.org/W2147776616","https://openalex.org/W2152165958","https://openalex.org/W2154297943","https://openalex.org/W2154993501","https://openalex.org/W2160065222","https://openalex.org/W2299446443","https://openalex.org/W2888021163","https://openalex.org/W2965675269","https://openalex.org/W4386736719","https://openalex.org/W4387475584"],"related_works":[],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,6,31,47,50,54,84,145,152,155,160],"determining":[3],"the":[4,27,34,43,48,51,55,82,85,95,110,119,135,143,150,153,156,168],"existence":[5],"a":[7,20,58,123,131,146,161],"protograph-based":[8],"QC-LDPC":[9,147],"code":[10],"with":[11,97],"girth":[12],"<tex":[13,61,71,75,114,138],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[14,62,72,76,115,139],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$g$</tex>":[15],"and":[16,57,149],"shortest":[17,120],"blocklength":[18,44,121,144],"for":[19,42,70,94,113,122],"prescribed":[21],"protograph":[22,56,89,169],"has":[23,67,102],"been":[24,68,103],"investigated":[25],"in":[26,45,81,105,167],"literature.":[28],"In":[29,126],"some":[30],"these":[32],"works,":[33],"goal":[35],"was":[36],"to":[37,108],"obtain":[38],"an":[39],"algebraic":[40,65],"expression":[41,66],"terms":[46],"dimensions":[49],"biadjacency":[52],"matrix":[53,162],"lifting":[59,136],"factor":[60,137],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N$</tex>.":[63],"An":[64],"found":[69],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N$</tex>":[73,116,140],"when":[74],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$g&gt;":[77],"4$</tex>":[78],"is":[79],"desired":[80],"case":[83],"fully":[86],"connected":[87],"(all-one)":[88],"but":[90],"only":[91],"lower":[92],"bounds":[93],"cases":[96,107],"larger":[98],"girth.":[99],"Computer":[100],"search":[101],"used":[104],"most":[106],"determine":[109],"exact":[111],"value":[112],"that":[117],"gives":[118],"particular":[124],"protograph.":[125],"this":[127],"paper,":[128],"we":[129],"present":[130],"promising":[132],"connection":[133],"between":[134],"(and":[141],"therefore":[142],"code)":[148],"product":[151],"pivots":[154],"Hermite":[157],"normal":[158],"form":[159],"constructed":[163],"from":[164],"certain":[165],"substructures":[166],"called":[170],"tailless":[171],"backtrackless":[172],"closed":[173],"(TBC)":[174],"walks.":[175]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}