{"id":"https://openalex.org/W2798546267","doi":"https://doi.org/10.1109/isit.2018.8437637","title":"Decoding Reed-Muller Codes Using Minimum- Weight Parity Checks","display_name":"Decoding Reed-Muller Codes Using Minimum- Weight Parity Checks","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2798546267","doi":"https://doi.org/10.1109/isit.2018.8437637","mag":"2798546267"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437637","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437637","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1804.10319","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055530089","display_name":"Elia Santi","orcid":null},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Elia Santi","raw_affiliation_strings":["Department of Information Engineering, University of Parma, Parma, Italy","University of Parma Department of Information Engineering Parma Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, University of Parma, Parma, Italy","institution_ids":["https://openalex.org/I124601658"]},{"raw_affiliation_string":"University of Parma Department of Information Engineering Parma Italy","institution_ids":["https://openalex.org/I124601658"]}]},{"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/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]},{"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","US"],"is_corresponding":false,"raw_author_name":"Christian Hager","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Duke University, Durham, North Carolina","Chalmers University of Technology, Department of Electrical Engineering, Gothenburg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Duke University, Durham, North Carolina","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Chalmers University of Technology, Department of Electrical Engineering, 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":["Department of Electrical and Computer Engineering, Duke University, Durham, North Carolina","Duke University,Department of Electrical and Computer Engineering,Durham,North Carolina"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Duke University, Durham, North Carolina","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Duke University,Department of Electrical and Computer Engineering,Durham,North Carolina","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3953,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.64701226,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1296","last_page":"1300"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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.9998999834060669,"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.9991000294685364,"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/T11130","display_name":"Coding theory and cryptography","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/decoding-methods","display_name":"Decoding methods","score":0.7740861177444458},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.7359030246734619},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.609610378742218},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.5909797549247742},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5508480668067932},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.5384141802787781},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.5306524038314819},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5125781893730164},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4987964630126953},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4738995134830475},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.44718137383461},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4113297760486603},{"id":"https://openalex.org/keywords/additive-white-gaussian-noise","display_name":"Additive white Gaussian noise","score":0.4110720753669739},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.37887734174728394},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3701549172401428},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3695477247238159},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.36667633056640625},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.3410555124282837},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2647359371185303},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.13878324627876282},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.13683417439460754}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7740861177444458},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7359030246734619},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.609610378742218},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.5909797549247742},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5508480668067932},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.5384141802787781},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.5306524038314819},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5125781893730164},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4987964630126953},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4738995134830475},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.44718137383461},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4113297760486603},{"id":"https://openalex.org/C169334058","wikidata":"https://www.wikidata.org/wiki/Q353292","display_name":"Additive white Gaussian noise","level":3,"score":0.4110720753669739},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.37887734174728394},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3701549172401428},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3695477247238159},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.36667633056640625},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.3410555124282837},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2647359371185303},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.13878324627876282},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.13683417439460754},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/isit.2018.8437637","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437637","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1804.10319","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1804.10319","pdf_url":"https://arxiv.org/pdf/1804.10319","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"","raw_type":"text"},{"id":"pmh:oai:research.chalmers.se:507229","is_oa":true,"landing_page_url":"https://research.chalmers.se/en/publication/507229","pdf_url":"https://research.chalmers.se/publication/507229/file/507229_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":"mag:2798546267","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1804.10319","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1804.10319","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1804.10319","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1804.10319","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1804.10319","pdf_url":"https://arxiv.org/pdf/1804.10319","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3095464751","display_name":"Coding for terabit-per-second fiber-optical communications","funder_award_id":"749798","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7842005466","display_name":null,"funder_award_id":"Horizon 2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8686538604","display_name":null,"funder_award_id":"1718494","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"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1536930200","https://openalex.org/W1606480398","https://openalex.org/W2004229705","https://openalex.org/W2005692408","https://openalex.org/W2068582919","https://openalex.org/W2077814477","https://openalex.org/W2078633872","https://openalex.org/W2091121840","https://openalex.org/W2102864653","https://openalex.org/W2106045225","https://openalex.org/W2115929510","https://openalex.org/W2139164285","https://openalex.org/W2140124864","https://openalex.org/W2156826724","https://openalex.org/W2157720168","https://openalex.org/W2169134868","https://openalex.org/W2170187382","https://openalex.org/W2524538702","https://openalex.org/W2528151179","https://openalex.org/W2591190829","https://openalex.org/W2962890394","https://openalex.org/W6651339336"],"related_works":["https://openalex.org/W2964292940","https://openalex.org/W2987449952","https://openalex.org/W2501626284","https://openalex.org/W172055330","https://openalex.org/W3105513639","https://openalex.org/W2152012980","https://openalex.org/W2137787303","https://openalex.org/W2962911078","https://openalex.org/W2962890394","https://openalex.org/W2847585743","https://openalex.org/W850336655","https://openalex.org/W2096689662","https://openalex.org/W2532468848","https://openalex.org/W2963619914","https://openalex.org/W3197666434","https://openalex.org/W847232657","https://openalex.org/W2813336964","https://openalex.org/W1970907073","https://openalex.org/W3047833124","https://openalex.org/W2807964302"],"abstract_inverted_index":{"Reed-Muller":[0],"(RM)":[1],"codes":[2,29],"exhibit":[3],"good":[4],"performance":[5,37,108,149],"under":[6],"maximum-likelihood":[7],"(ML)":[8],"decoding":[9,47,80,93,141],"due":[10],"to":[11,34,44,48,121,126,146,155],"their":[12],"highly-symmetric":[13],"structure.":[14],"In":[15],"this":[16],"paper,":[17],"we":[18,65],"explore":[19],"the":[20,24,57,67,71,82,95,123,127,157],"question":[21],"of":[22,27,136,160],"whether":[23],"code":[25],"symmetry":[26],"RM":[28],"can":[30,109],"also":[31,117],"be":[32,111],"exploited":[33],"achieve":[35],"near-ML":[36,107],"in":[38,113],"practice.":[39],"The":[40],"main":[41],"idea":[42],"is":[43,104],"apply":[45],"iterative":[46],"a":[49,119,133],"highly-redundant":[50],"parity-check":[51],"(PC)":[52],"matrix":[53,125],"that":[54,106],"contains":[55],"only":[56,132],"minimum-weight":[58,138,161],"dual":[59],"codewords":[60],"as":[61],"rows.":[62],"As":[63],"examples,":[64],"consider":[66],"peeling":[68],"decoder":[69],"for":[70,81,94],"binary":[72,96],"erasure":[73],"channel,":[74,88],"linear-programming":[75],"and":[76,89,91,150],"belief":[77],"propagation":[78],"(BP)":[79],"binary-input":[83],"additive":[84],"white":[85],"Gaussian":[86],"noise":[87],"bit-flipping":[90],"BP":[92],"symmetric":[97],"channel.":[98],"For":[99],"short":[100],"block":[101],"lengths,":[102],"it":[103],"shown":[105],"indeed":[110],"achieved":[112],"many":[114],"cases.":[115],"We":[116],"propose":[118],"method":[120],"tailor":[122],"PC":[124],"received":[128],"observation":[129],"by":[130],"selecting":[131],"small":[134],"fraction":[135],"useful":[137],"PCs":[139],"before":[140],"begins.":[142],"This":[143],"allows":[144],"one":[145],"both":[147],"improve":[148],"significantly":[151],"reduce":[152],"complexity":[153],"compared":[154],"using":[156],"full":[158],"set":[159],"PCs.":[162]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-20T22:02:38.213706","created_date":"2025-10-10T00:00:00"}