{"id":"https://openalex.org/W7165641390","doi":"https://doi.org/10.48550/arxiv.2606.23161","title":"On the Intractability of the Minimum Distance Problem for Regular LDPC Codes","display_name":"On the Intractability of the Minimum Distance Problem for Regular LDPC Codes","publication_year":2026,"publication_date":"2026-06-22","ids":{"openalex":"https://openalex.org/W7165641390","doi":"https://doi.org/10.48550/arxiv.2606.23161"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.23161","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.23161","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.23161","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070063746","display_name":"Chenyuan Jia","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jia, Chenyuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134778165","display_name":"Qingqing Peng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peng, Qingqing","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139197985","display_name":"Ke Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Ke","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139130999","display_name":"Guanghui Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Guanghui","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5139155589","display_name":"Guiying Yan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yan, Guiying","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9710999727249146,"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.9710999727249146,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.010900000110268593,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.003100000089034438,"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/bijection-injection-and-surjection","display_name":"Bijection, injection and surjection","score":0.7084000110626221},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6758000254631042},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5918999910354614},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.550599992275238},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.5209000110626221},{"id":"https://openalex.org/keywords/transfer","display_name":"Transfer (computing)","score":0.415800005197525},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.39820000529289246},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.3935999870300293},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.3889000117778778}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7717000246047974},{"id":"https://openalex.org/C48659774","wikidata":"https://www.wikidata.org/wiki/Q4907197","display_name":"Bijection, injection and surjection","level":3,"score":0.7084000110626221},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6758000254631042},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5918999910354614},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5902000069618225},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.550599992275238},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5245000123977661},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.5209000110626221},{"id":"https://openalex.org/C2776175482","wikidata":"https://www.wikidata.org/wiki/Q1195816","display_name":"Transfer (computing)","level":2,"score":0.415800005197525},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.39820000529289246},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.3935999870300293},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3889000117778778},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.382999986410141},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.37630000710487366},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.36469998955726624},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.36340001225471497},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.3409999907016754},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.32440000772476196},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.32190001010894775},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3215000033378601},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2953000068664551},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.289900004863739},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.2897999882698059},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.27399998903274536},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.25929999351501465},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25859999656677246}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.23161","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.23161","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.23161","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.23161","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"score":0.4876057803630829,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,174,213],"minimum":[1,221],"distance":[2,222],"problem":[3,13,77],"(MDP)":[4],"for":[5,60,80,105,108,165,169],"low-density":[6],"parity-check":[7],"(LDPC)":[8],"codes":[9],"is":[10,18,34,78,90],"a":[11,120,150,159,179],"central":[12],"in":[14,45,145],"coding":[15],"theory":[16],"and":[17,27,63,85,148,190,209],"closely":[19],"related":[20],"to":[21],"the":[22,31,58,74,95,137,146,216],"analysis":[23],"of":[24,184,219],"low-weight":[25],"codewords":[26],"error-floor":[28],"behavior.":[29],"Although":[30],"unrestricted":[32],"MDP":[33,59],"computationally":[35],"intractable,":[36],"its":[37,87],"complexity":[38],"under":[39,224],"degree":[40,198],"constraints":[41],"that":[42,73,86],"commonly":[43],"occur":[44],"LDPC":[46],"code":[47],"design":[48],"has":[49],"remained":[50],"less":[51],"clear.":[52],"In":[53],"this":[54,129,155],"paper,":[55],"we":[56,71,102],"study":[57],"left":[61],"regular":[62,82],"biregular":[64,99],"Tanner":[65,83,100,167],"graphs.":[66],"For":[67,98],"every":[68,109,170],"fixed":[69,110,171],"$J\\geq3$,":[70],"prove":[72,103],"standard":[75],"at-most-weight":[76],"$\\mathrm{NP}$-complete":[79],"$J$-left":[81],"graphs":[84,168],"exact-weight":[88],"variant":[89],"$\\mathrm{W}[1]$-complete":[91],"when":[92],"parameterized":[93],"by":[94,113],"prescribed":[96],"weight.":[97],"graphs,":[101],"$\\mathrm{NP}$-completeness":[104,164],"$(3,K)$-regular":[106],"instances":[107],"$K\\geq":[111],"3$":[112],"replacing":[114],"degree-two":[115],"auxiliary":[116],"completion":[117],"blocks":[118],"with":[119,158],"single-port":[121],"high-girth":[122],"gadget.":[123],"A":[124],"nonzero":[125,205],"relative":[126],"support":[127],"inside":[128],"gadget":[130],"induces":[131],"an":[132,141],"essentially":[133],"cubic":[134],"graph,":[135],"so":[136],"Moore":[138],"bound":[139,144],"gives":[140],"exponential":[142],"lower":[143],"girth":[147],"allows":[149],"polynomial-size":[151],"Karp":[152],"reduction.":[153],"Combining":[154],"right-degree":[156],"amplification":[157,162],"replica-and-global-check":[160],"left-degree":[161],"yields":[163],"$(J,K)$-regular":[166],"$J,K\\geq":[172],"3$.":[173],"reductions":[175],"are":[176],"based":[177],"on":[178],"degree-preserving":[180],"transformation":[181],"framework":[182],"consisting":[183],"hyperedge":[185],"decomposition,":[186],"check":[187],"node":[188],"splitting,":[189],"controlled":[191],"variable":[192],"replication.":[193],"These":[194],"transformations":[195],"relate":[196],"different":[197],"distributions":[199],"while":[200],"preserving":[201],"explicit":[202],"maps":[203],"among":[204],"codewords,":[206],"even":[207],"covers,":[208],"nonempty":[210],"$(a,0)$-trapping":[211],"sets.":[212],"results":[214],"delineate":[215],"computational":[217],"limits":[218],"computing":[220],"exactly":[223],"natural":[225],"regularity":[226],"constraints.":[227]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-24T00:00:00"}