{"id":"https://openalex.org/W4415367140","doi":"https://doi.org/10.1109/isit63088.2025.11195214","title":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","display_name":"Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367140","doi":"https://doi.org/10.1109/isit63088.2025.11195214"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195214","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195214","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/A5119950240","display_name":"Sheida Rabeti","orcid":null},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sheida Rabeti","raw_affiliation_strings":["Northeastern University,Department of Electrical and Computer Engineering,Boston,MA,USA,02115"],"affiliations":[{"raw_affiliation_string":"Northeastern University,Department of Electrical and Computer Engineering,Boston,MA,USA,02115","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101605921","display_name":"Mohsen Moradi","orcid":"https://orcid.org/0000-0001-7026-0682"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohsen Moradi","raw_affiliation_strings":["Northeastern University,Department of Electrical and Computer Engineering,Boston,MA,USA,02115"],"affiliations":[{"raw_affiliation_string":"Northeastern University,Department of Electrical and Computer Engineering,Boston,MA,USA,02115","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056299839","display_name":"Hessam Mahdavifar","orcid":"https://orcid.org/0000-0001-9021-1992"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hessam Mahdavifar","raw_affiliation_strings":["Northeastern University,Department of Electrical and Computer Engineering,Boston,MA,USA,02115"],"affiliations":[{"raw_affiliation_string":"Northeastern University,Department of Electrical and Computer Engineering,Boston,MA,USA,02115","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5119950240"],"corresponding_institution_ids":["https://openalex.org/I12912129"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29053863,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10849","display_name":"Finite Group Theory Research","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.8198999762535095},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7732999920845032},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5001999735832214},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.4726000130176544},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.41040000319480896},{"id":"https://openalex.org/keywords/odd-graph","display_name":"Odd graph","score":0.4072999954223633},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.35659998655319214},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.3546000123023987},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.34950000047683716}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8242999911308289},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.8198999762535095},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7732999920845032},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7034000158309937},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5547000169754028},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5001999735832214},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.4726000130176544},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.41040000319480896},{"id":"https://openalex.org/C206815938","wikidata":"https://www.wikidata.org/wiki/Q7077445","display_name":"Odd graph","level":5,"score":0.4072999954223633},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.35659998655319214},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.3546000123023987},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.34950000047683716},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.31060001254081726},{"id":"https://openalex.org/C114727528","wikidata":"https://www.wikidata.org/wiki/Q7840044","display_name":"Triangle-free graph","level":5,"score":0.3100000023841858},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.30379998683929443},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.3005000054836273},{"id":"https://openalex.org/C68996132","wikidata":"https://www.wikidata.org/wiki/Q3115485","display_name":"Foster graph","level":5,"score":0.29679998755455017},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.2775000035762787},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.2734000086784363},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.27309998869895935},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.26739999651908875},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.258899986743927},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.2565000057220459}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195214","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195214","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":[{"id":"https://openalex.org/G8552515235","display_name":null,"funder_award_id":"CCF-2415440","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1496989121","https://openalex.org/W1667880265","https://openalex.org/W1977699786","https://openalex.org/W2023600080","https://openalex.org/W2051411864","https://openalex.org/W2055491005","https://openalex.org/W2058374373","https://openalex.org/W2100534737","https://openalex.org/W2103353540","https://openalex.org/W2107621627","https://openalex.org/W2125732536","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2135764410","https://openalex.org/W2169732368","https://openalex.org/W2299446443","https://openalex.org/W3192350410","https://openalex.org/W4402159840"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,88],"explore":[4],"the":[5,28,34,37,40,43,46,57,60,68,78,175,183],"design":[6,187],"and":[7,26,42,50,113,145,193],"analysis":[8],"of":[9,39,45,48,59,71,80,106,129,137,153],"regular":[10,63],"bipartite":[11,64,93],"graphs":[12,94,118],"motivated":[13],"by":[14],"their":[15],"application":[16],"in":[17,27,62,197],"lowdensity":[18],"parity-check":[19,161],"(LDPC)":[20],"codes":[21,165,189],"specifically":[22,196],"with":[23,75,95,125,166,190],"constrained":[24],"girth":[25,38,84,96,152,192],"high-rate":[29,164],"regime.":[30],"We":[31,53],"focus":[32,173],"on":[33,56,102,116,174],"relation":[35],"between":[36],"graph,":[41],"size":[44,58],"sets":[47],"variable":[49,81],"check":[51,72,130],"nodes.":[52,131],"derive":[54],"bounds":[55],"vertices":[61],"graphs,":[65,112],"showing":[66],"how":[67],"required":[69],"number":[70,79,128],"nodes":[73,82],"grows":[74,85],"respect":[76],"to":[77,182,186],"as":[83],"large.":[86],"Furthermore,":[87],"present":[89],"two":[90],"constructions":[91,157],"for":[92,163],"<tex":[97],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[98,108],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathcal{G}=8$</tex>;":[99],"one":[100],"based":[101,115],"a":[103,126,151],"greedy":[104],"construction":[105,134],"(<tex":[107],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$w_{c},":[109],"w_{r}$</tex>)":[110],"-regular":[111],"another":[114],"semi-regular":[117],"which":[119],"have":[120],"uniform":[121],"column":[122],"weight":[123],"distribution":[124],"sublinear":[127],"The":[132],"second":[133],"leverages":[135],"sequences":[136],"integers":[138],"without":[139],"any":[140],"length-":[141],"3":[142],"arithmetic":[143],"progression":[144],"is":[146],"asymptotically":[147],"optimal":[148],"while":[149],"maintaining":[150],"8.":[154],"Also,":[155],"both":[156],"can":[158,179],"offer":[159],"sparse":[160],"matrices":[162],"medium-to-large":[167],"block":[168],"lengths.":[169],"Our":[170],"results":[171],"solely":[172],"graph-theoretic":[176],"problem":[177],"but":[178],"potentially":[180],"contribute":[181],"ongoing":[184],"effort":[185],"LDPC":[188],"high":[191,198],"minimum":[194],"distance,":[195],"code":[199],"rates.":[200]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-21T00:00:00"}