{"id":"https://openalex.org/W4414634789","doi":"https://doi.org/10.1109/tcomm.2025.3647737","title":"A Markov Chain Monte Carlo Method for Efficient Finite-Length LDPC Code Design","display_name":"A Markov Chain Monte Carlo Method for Efficient Finite-Length LDPC Code Design","publication_year":2025,"publication_date":"2025-12-23","ids":{"openalex":"https://openalex.org/W4414634789","doi":"https://doi.org/10.1109/tcomm.2025.3647737"},"language":"en","primary_location":{"id":"doi:10.1109/tcomm.2025.3647737","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2025.3647737","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2504.16071","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113109524","display_name":"Ata Tanr\u0131kulu","orcid":null},"institutions":[{"id":"https://openalex.org/I201799495","display_name":"Middle East Technical University","ror":"https://ror.org/014weej12","country_code":"TR","type":"education","lineage":["https://openalex.org/I201799495"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Ata Tanr\u0131kulu","raw_affiliation_strings":["Department of Electrical and Electronics Engineering, Middle East Technical University (METU), Ankara, Türkiye"],"raw_orcid":"https://orcid.org/0009-0001-3038-9219","affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Middle East Technical University (METU), Ankara, Türkiye","institution_ids":["https://openalex.org/I201799495"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082160356","display_name":"Mete Y\u0131ld\u0131r\u0131m","orcid":null},"institutions":[{"id":"https://openalex.org/I201799495","display_name":"Middle East Technical University","ror":"https://ror.org/014weej12","country_code":"TR","type":"education","lineage":["https://openalex.org/I201799495"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Mete Y\u0131ld\u0131r\u0131m","raw_affiliation_strings":["Department of Electrical and Electronics Engineering, Middle East Technical University (METU), Ankara, Türkiye"],"raw_orcid":"https://orcid.org/0009-0007-1884-0269","affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Middle East Technical University (METU), Ankara, Türkiye","institution_ids":["https://openalex.org/I201799495"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066643381","display_name":"Ahmed Hareedy","orcid":"https://orcid.org/0000-0002-8523-6754"},"institutions":[{"id":"https://openalex.org/I201799495","display_name":"Middle East Technical University","ror":"https://ror.org/014weej12","country_code":"TR","type":"education","lineage":["https://openalex.org/I201799495"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Ahmed Hareedy","raw_affiliation_strings":["Department of Electrical and Electronics Engineering, Middle East Technical University (METU), Ankara, Türkiye"],"raw_orcid":"https://orcid.org/0000-0002-8523-6754","affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Middle East Technical University (METU), Ankara, Türkiye","institution_ids":["https://openalex.org/I201799495"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I201799495"],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22343747,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"74","issue":null,"first_page":"5979","last_page":"5993"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.994700014591217,"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.994700014591217,"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.9803000092506409,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9757999777793884,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/markov-chain","display_name":"Markov chain","score":0.6933000087738037},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6215000152587891},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.5615000128746033},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5074999928474426},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.4706999957561493},{"id":"https://openalex.org/keywords/degrees-of-freedom","display_name":"Degrees of freedom (physics and chemistry)","score":0.448199987411499},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.4377000033855438},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.42250001430511475}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6933000087738037},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6215000152587891},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6049000024795532},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5964999794960022},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.5615000128746033},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5074999928474426},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47119998931884766},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.4706999957561493},{"id":"https://openalex.org/C208081375","wikidata":"https://www.wikidata.org/wiki/Q274502","display_name":"Degrees of freedom (physics and chemistry)","level":2,"score":0.448199987411499},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4377000033855438},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.42250001430511475},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.3880000114440918},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.382999986410141},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3540000021457672},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33550000190734863},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.33399999141693115},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33379998803138733},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3021000027656555},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.28610000014305115},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C97074811","wikidata":"https://www.wikidata.org/wiki/Q6771322","display_name":"Markov chain mixing time","level":5,"score":0.26460000872612}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tcomm.2025.3647737","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2025.3647737","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2504.16071","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.16071","pdf_url":"https://arxiv.org/pdf/2504.16071","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2504.16071","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2504.16071","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":"pmh:oai:arXiv.org:2504.16071","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.16071","pdf_url":"https://arxiv.org/pdf/2504.16071","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414634789.pdf","grobid_xml":"https://content.openalex.org/works/W4414634789.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Low-density":[0],"parity-check":[1],"(LDPC)":[2],"codes":[3,30,54,57,289],"are":[4,55,65,221],"among":[5],"the":[6,37,72,106,143,147,153,165,168,194,197,212,224,230,233,250,253,260,267,303,309,325],"most":[7],"prominent":[8],"error-correction":[9],"schemes":[10],"in":[11,36,67,298],"today\u2019s":[12],"data-driven":[13],"world.":[14],"They":[15],"find":[16],"application":[17],"to":[18,69,100,223,242,266,307],"fortify":[19],"various":[20],"modern":[21],"storage,":[22],"communication,":[23],"and":[24,40,44,50,82,116,295],"computing":[25],"systems.":[26],"Protograph-based":[27],"(PB)":[28],"LDPC":[29],"offer":[31],"many":[32],"degrees":[33,74],"of":[34,75,108,118,149,167,196,199,232,236,252,262,312,318],"freedom":[35,76],"code":[38,131,275],"design":[39,276],"enable":[41],"fast":[42],"encoding":[43],"decoding.":[45],"In":[46,85],"particular,":[47],"spatially-coupled":[48],"(SC)":[49],"multi-dimensional":[51],"(MD)":[52],"circulant-based":[53],"PB-LDPC":[56],"with":[58,274,290,302,324],"excellent":[59],"performance.":[60],"Efficient":[61],"finite-length":[62],"(FL)":[63],"algorithms":[64],"required":[66,238],"order":[68,231],"effectively":[70,124],"exploit":[71],"available":[73,326],"offered":[77],"by":[78,239],"SC":[79,119,288],"partitioning,":[80],"lifting,":[81],"MD":[83],"relocations.":[84],"this":[86,102],"paper,":[87],"we":[88,112,135,163,191,214,228],"propose":[89],"a":[90,139,175,185,203,207,244],"novel":[91],"Markov":[92,169,254],"chain":[93,170,255],"Monte":[94],"Carlo":[95],"(MCMC":[96],"or":[97,178],"MC2)":[98],"method":[99],"perform":[101],"FL":[103],"optimization,":[104],"addressing":[105],"removal":[107],"short":[109,150,293],"cycles.":[110],"While":[111,133],"focus":[113],"on":[114,206,279],"partitioning":[115,177],"lifting":[117,179],"codes,":[120],"our":[121,159,189,240,285,314],"MC2approach":[122,241],"can":[123],"work":[125],"for":[126,217],"other":[127,130],"procedures":[128],"and/or":[129],"designs.":[132],"iterating,":[134],"draw":[136],"samples":[137],"from":[138,152,202],"defined":[140],"distribution":[141,195],"where":[142,171],"probability":[144,261],"decreases":[145],"as":[146,162,247,249],"number":[148,198,235,311],"cycles":[151,200,294],"previous":[154],"iteration":[155],"increases.":[156],"We":[157],"analyze":[158],"MC2method":[160,286,315],"theoretically":[161],"prove":[164],"invariance":[166],"each":[172],"state":[173],"represents":[174],"possible":[176],"arrangement,":[180],"i.e.,":[181],"sample,":[182],"that":[183,220,284],"has":[184],"specific":[186],"probability.":[187],"Via":[188],"simulations,":[190],"then":[192],"fit":[193],"resulting":[201],"given":[204],"arrangement":[205],"Gaussian":[208],"distribution.":[209],"By":[210],"analyzing":[211],"mean,":[213],"derive":[215,229],"estimates":[216],"cycle":[218],"counts":[219],"close":[222,265],"actual":[225],"counts.":[226],"Furthermore,":[227],"expected":[234],"iterations":[237],"reach":[243,308],"local":[245,268],"minimum":[246],"well":[248],"size":[251],"recurrent":[256],"class":[257],"through":[258],"approximating":[259],"getting":[263],"arbitrarily":[264],"minimum.":[269],"Our":[270],"approach":[271],"is":[272],"compatible":[273],"techniques":[277],"based":[278],"gradient-descent.":[280],"Experimental":[281],"results":[282],"show":[283],"generates":[287],"remarkably":[291],"fewer":[292],"substantial":[296],"gains":[297],"error/erasure-rate":[299],"performance":[300],"compared":[301,323],"current":[304],"state-of-the-art.":[305],"Moreover,":[306],"same":[310],"cycles,":[313],"requires":[316],"orders":[317],"magnitude":[319],"less":[320],"overall":[321],"time":[322],"literature":[327],"methods.":[328]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-01T00:00:00"}