{"id":"https://openalex.org/W4415367313","doi":"https://doi.org/10.1109/isit63088.2025.11195291","title":"On the Worst-Case Complexity of Gibbs Decoding for Reed-Muller Codes","display_name":"On the Worst-Case Complexity of Gibbs Decoding for Reed-Muller Codes","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367313","doi":"https://doi.org/10.1109/isit63088.2025.11195291"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195291","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195291","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":null,"display_name":"Xuzhe Xia","orcid":null},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Xuzhe Xia","raw_affiliation_strings":["University of British Columbia,Vancouver,Canada"],"affiliations":[{"raw_affiliation_string":"University of British Columbia,Vancouver,Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119823815","display_name":"Nicholas Kwan","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Nicholas Kwan","raw_affiliation_strings":["University of Toronto,Toronto,Canada"],"affiliations":[{"raw_affiliation_string":"University of Toronto,Toronto,Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100383688","display_name":"Lele Wang","orcid":"https://orcid.org/0000-0002-4077-433X"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Lele Wang","raw_affiliation_strings":["University of British Columbia,Vancouver,Canada"],"affiliations":[{"raw_affiliation_string":"University of British Columbia,Vancouver,Canada","institution_ids":["https://openalex.org/I141945490"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I141945490"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2517832,"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/T12029","display_name":"DNA and Biological Computing","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9930999875068665,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9894999861717224,"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/gibbs-sampling","display_name":"Gibbs sampling","score":0.7964000105857849},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7383000254631042},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.6474999785423279},{"id":"https://openalex.org/keywords/mixing","display_name":"Mixing (physics)","score":0.6152999997138977},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5238999724388123},{"id":"https://openalex.org/keywords/posterior-probability","display_name":"Posterior probability","score":0.4650000035762787},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4404999911785126},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.3668000102043152},{"id":"https://openalex.org/keywords/maximum-a-posteriori-estimation","display_name":"Maximum a posteriori estimation","score":0.3538999855518341}],"concepts":[{"id":"https://openalex.org/C158424031","wikidata":"https://www.wikidata.org/wiki/Q1191905","display_name":"Gibbs sampling","level":3,"score":0.7964000105857849},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7383000254631042},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.6474999785423279},{"id":"https://openalex.org/C138777275","wikidata":"https://www.wikidata.org/wiki/Q6884054","display_name":"Mixing (physics)","level":2,"score":0.6152999997138977},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5810999870300293},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5600000023841858},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5238999724388123},{"id":"https://openalex.org/C57830394","wikidata":"https://www.wikidata.org/wiki/Q278079","display_name":"Posterior probability","level":3,"score":0.4650000035762787},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4404999911785126},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.388700008392334},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.3668000102043152},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36640000343322754},{"id":"https://openalex.org/C9810830","wikidata":"https://www.wikidata.org/wiki/Q635384","display_name":"Maximum a posteriori estimation","level":3,"score":0.3538999855518341},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3393000066280365},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.3224000036716461},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.3100999891757965},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.2989000082015991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29750001430511475},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.28999999165534973},{"id":"https://openalex.org/C204693719","wikidata":"https://www.wikidata.org/wiki/Q910810","display_name":"Metropolis\u2013Hastings algorithm","level":4,"score":0.2655999958515167},{"id":"https://openalex.org/C189973286","wikidata":"https://www.wikidata.org/wiki/Q176695","display_name":"Markov property","level":4,"score":0.26249998807907104},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2574000060558319},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.2549000084400177},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.25440001487731934},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.2542000114917755},{"id":"https://openalex.org/C187192777","wikidata":"https://www.wikidata.org/wiki/Q381699","display_name":"Rejection sampling","level":5,"score":0.2538999915122986}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195291","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195291","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":13,"referenced_works":["https://openalex.org/W2004229705","https://openalex.org/W2103524940","https://openalex.org/W2121417875","https://openalex.org/W2149250337","https://openalex.org/W2591190829","https://openalex.org/W2782562097","https://openalex.org/W2885549115","https://openalex.org/W2962970830","https://openalex.org/W2976297103","https://openalex.org/W3132541152","https://openalex.org/W4380679932","https://openalex.org/W4386066325","https://openalex.org/W4401692911"],"related_works":[],"abstract_inverted_index":{"Reed-Muller":[0],"(RM)":[1],"codes":[2,60],"are":[3],"known":[4],"to":[5,26,35,87,94,145,147],"achieve":[6],"capacity":[7,29],"on":[8],"binary":[9],"symmetric":[10],"channels":[11],"(BSC)":[12],"under":[13],"the":[14,52,79,88,105,109,119,137,140,148],"Maximum":[15],"a":[16,28,36],"Posteriori":[17],"(MAP)":[18],"decoder.":[19,33],"However,":[20],"it":[21,43],"remains":[22],"an":[23],"open":[24],"problem":[25],"design":[27],"achieving":[30],"polynomial-time":[31],"RM":[32,59,113],"Due":[34],"lemma":[37],"by":[38,49,82],"Liu,":[39],"Cuff,":[40],"and":[41,90],"Verd\u00fa,":[42],"can":[44,91,122],"be":[45,92],"shown":[46],"that":[47,118],"decoding":[48,98],"sampling":[50],"from":[51,78],"posterior":[53,80,150],"distribution":[54,81],"is":[55,66],"also":[56],"capacity-achieving":[57],"for":[58,112,126],"over":[61],"BSC.":[62],"The":[63],"Gibbs":[64,110,120],"decoder":[65,111,121,141],"one":[67],"such":[68],"Markov":[69],"Chain":[70],"Monte":[71],"Carlo":[72],"(MCMC)":[73],"based":[74],"method,":[75],"which":[76],"samples":[77],"flipping":[83],"message":[84],"bits":[85],"according":[86],"posterior,":[89],"modified":[93],"give":[95],"other":[96],"MCMC":[97],"methods.":[99],"In":[100],"this":[101],"paper,":[102],"we":[103],"analyze":[104],"mixing":[106,125,133],"time":[107,144],"of":[108],"codes.":[114],"Our":[115],"analysis":[116],"reveals":[117],"exhibit":[123],"slow":[124,132],"certain":[127],"carefully":[128],"constructed":[129],"sequences.":[130],"This":[131],"implies":[134],"that,":[135],"in":[136],"worst-case":[138],"scenario,":[139],"requires":[142],"super-polynomial":[143],"converge":[146],"desired":[149],"distribution.":[151]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-21T00:00:00"}