{"id":"https://openalex.org/W3035162521","doi":"https://doi.org/10.1109/isit44484.2020.9174087","title":"Decoding Reed\u2013Muller Codes Using Redundant Code Constraints","display_name":"Decoding Reed\u2013Muller Codes Using Redundant Code Constraints","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3035162521","doi":"https://doi.org/10.1109/isit44484.2020.9174087","mag":"3035162521"},"language":"en","primary_location":{"id":"doi:10.1109/isit44484.2020.9174087","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.chalmers.se/publication/527702/file/527702_Fulltext.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026469085","display_name":"Mengke Lian","orcid":null},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mengke Lian","raw_affiliation_strings":["Duke University,Department of Electrical and Computer Engineering,Durham,North Carolina","Department of Electrical and Computer Engineering, Duke University, Durham, North Carolina"],"affiliations":[{"raw_affiliation_string":"Duke University,Department of Electrical and Computer Engineering,Durham,North Carolina","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Duke University, Durham, North Carolina","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017892747","display_name":"Christian H\u00e4ger","orcid":"https://orcid.org/0000-0002-5155-8018"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Christian H\u00e4ger","raw_affiliation_strings":["Chalmers University of Technology,Department of Electrical Engineering,Gothenburg,Sweden","Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden"],"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology,Department of Electrical Engineering,Gothenburg,Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034044119","display_name":"Henry D. Pfister","orcid":"https://orcid.org/0000-0001-5521-4397"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Henry D. Pfister","raw_affiliation_strings":["Duke University,Department of Electrical and Computer Engineering,Durham,North Carolina","Department of Electrical and Computer Engineering, Duke University, Durham, North Carolina"],"affiliations":[{"raw_affiliation_string":"Duke University,Department of Electrical and Computer Engineering,Durham,North Carolina","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Duke University, Durham, North Carolina","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5026469085"],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":null,"apc_paid":null,"fwci":4.352,"has_fulltext":true,"cited_by_count":39,"citation_normalized_percentile":{"value":0.94610961,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"42","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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":1.0,"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/T12029","display_name":"DNA and Biological Computing","score":0.9958000183105469,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9941999912261963,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/puncturing","display_name":"Puncturing","score":0.970044732093811},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.8553716540336609},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6823157668113708},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6779791116714478},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.6646523475646973},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.6534597873687744},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5838497281074524},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5802623629570007},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5717787146568298},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5383255481719971},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.5097243189811707},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3944849967956543},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3043644428253174},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.17867973446846008},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.10536360740661621},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.06860566139221191}],"concepts":[{"id":"https://openalex.org/C2778808095","wikidata":"https://www.wikidata.org/wiki/Q3899825","display_name":"Puncturing","level":2,"score":0.970044732093811},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8553716540336609},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6823157668113708},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6779791116714478},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.6646523475646973},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.6534597873687744},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5838497281074524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5802623629570007},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5717787146568298},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5383255481719971},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.5097243189811707},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3944849967956543},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3043644428253174},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.17867973446846008},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.10536360740661621},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.06860566139221191},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit44484.2020.9174087","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:research.chalmers.se:527702","is_oa":true,"landing_page_url":"https://research.chalmers.se/en/publication/21567785-4258-4784-acbc-4b2abce95311","pdf_url":"https://research.chalmers.se/publication/527702/file/527702_Fulltext.pdf","source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:research.chalmers.se:519139","is_oa":false,"landing_page_url":"http://doi.org/10.1109/ISIT44484.2020.9174087","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:research.chalmers.se:527702","is_oa":true,"landing_page_url":"https://research.chalmers.se/en/publication/21567785-4258-4784-acbc-4b2abce95311","pdf_url":"https://research.chalmers.se/publication/527702/file/527702_Fulltext.pdf","source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W3035162521.pdf"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W203556697","https://openalex.org/W1606480398","https://openalex.org/W2004229705","https://openalex.org/W2023355697","https://openalex.org/W2025948462","https://openalex.org/W2091121840","https://openalex.org/W2103524940","https://openalex.org/W2106045225","https://openalex.org/W2107274955","https://openalex.org/W2107389879","https://openalex.org/W2114468914","https://openalex.org/W2121417875","https://openalex.org/W2121498709","https://openalex.org/W2137813581","https://openalex.org/W2149250337","https://openalex.org/W2156826724","https://openalex.org/W2591190829","https://openalex.org/W2666368276","https://openalex.org/W2964126297","https://openalex.org/W2964292940","https://openalex.org/W2976077638","https://openalex.org/W2976297103","https://openalex.org/W3009999666","https://openalex.org/W3035162521","https://openalex.org/W3105371711","https://openalex.org/W6651339336"],"related_works":["https://openalex.org/W4385859070","https://openalex.org/W4380030966","https://openalex.org/W2118148379","https://openalex.org/W2135229457","https://openalex.org/W2944806087","https://openalex.org/W2355675923","https://openalex.org/W2591644370","https://openalex.org/W1983324765","https://openalex.org/W2159021452","https://openalex.org/W3138245144"],"abstract_inverted_index":{"The":[0,60],"recursive":[1,72],"projection-aggregation":[2],"(RPA)":[3],"decoding":[4,30,97],"algorithm":[5,22,37,62],"for":[6],"Reed-Muller":[7],"(RM)":[8],"codes":[9],"was":[10],"recently":[11],"introduced":[12],"by":[13,31],"Ye":[14],"and":[15,69,84,86],"Abbe.":[16],"We":[17,46,75],"show":[18,87],"that":[19],"the":[20],"RPA":[21,83],"is":[23,70],"closely":[24],"related":[25],"to":[26,50,56],"(weighted)":[27],"belief-propagation":[28],"(BP)":[29],"interpreting":[32],"it":[33],"as":[34],"a":[35,39,52],"message-passing":[36],"on":[38,64],"factor":[40],"graph":[41],"with":[42,95],"redundant":[43],"code":[44],"constraints.":[45],"use":[47],"this":[48],"observation":[49],"introduce":[51],"novel":[53],"decoder":[54],"tailored":[55],"high-rate":[57],"RM":[58],"codes.":[59],"new":[61],"relies":[63],"puncturing":[65],"rather":[66],"than":[67],"projections":[68],"called":[71],"puncturing-aggregation":[73],"(RXA).":[74],"also":[76],"investigate":[77],"collapsed":[78],"(i.e.,":[79],"non-recursive)":[80],"versions":[81],"of":[82],"RXA":[85],"some":[88],"examples":[89],"where":[90],"they":[91],"achieve":[92],"similar":[93],"performance":[94],"lower":[96],"complexity.":[98]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}