{"id":"https://openalex.org/W2976297103","doi":"https://doi.org/10.1109/isit.2019.8849269","title":"Recursive projection-aggregation decoding of Reed-Muller codes","display_name":"Recursive projection-aggregation decoding of Reed-Muller codes","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2976297103","doi":"https://doi.org/10.1109/isit.2019.8849269","mag":"2976297103"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849269","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 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":"https://openalex.org/A5100725244","display_name":"Min Ye","orcid":"https://orcid.org/0000-0003-1351-8880"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Min Ye","raw_affiliation_strings":["EPFL and Princeton University"],"affiliations":[{"raw_affiliation_string":"EPFL and Princeton University","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055776312","display_name":"Emmanuel Abb\u00e9","orcid":"https://orcid.org/0000-0002-1831-656X"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emmanuel Abbe","raw_affiliation_strings":["Princeton University"],"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100725244"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":3.1503,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.92519306,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2064","last_page":"2068"},"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.9987000226974487,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.8263546228408813},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6232588887214661},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.554050624370575},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.530605137348175},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5274196863174438},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4305356740951538},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.4296583831310272},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3523169159889221},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31710484623908997},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.2537582516670227},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.15775373578071594}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8263546228408813},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6232588887214661},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.554050624370575},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.530605137348175},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5274196863174438},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4305356740951538},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.4296583831310272},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3523169159889221},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31710484623908997},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2537582516670227},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.15775373578071594}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2019.8849269","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 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":20,"referenced_works":["https://openalex.org/W1545614041","https://openalex.org/W1606480398","https://openalex.org/W2023355697","https://openalex.org/W2025948462","https://openalex.org/W2103524940","https://openalex.org/W2106045225","https://openalex.org/W2112446888","https://openalex.org/W2113237846","https://openalex.org/W2121417875","https://openalex.org/W2121498709","https://openalex.org/W2149250337","https://openalex.org/W2150498905","https://openalex.org/W2589095445","https://openalex.org/W2591190829","https://openalex.org/W2964292940","https://openalex.org/W2971934663","https://openalex.org/W2976297103","https://openalex.org/W3001795748","https://openalex.org/W3084582945","https://openalex.org/W6757005351"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W2357077655","https://openalex.org/W2351361564","https://openalex.org/W2144831582","https://openalex.org/W2129423808","https://openalex.org/W4205451769","https://openalex.org/W2029144766","https://openalex.org/W2542883969"],"abstract_inverted_index":{"We":[0,46,60],"propose":[1],"a":[2,118],"new":[3,91,125,146],"class":[4],"of":[5,50,123,139],"efficient":[6],"decoding":[7,29,98],"algorithms":[8,18,52,56,99],"for":[9,65,100,109,127,150],"Reed-Muller":[10],"(RM)":[11],"codes":[12,32,111,129],"over":[13],"binary-input":[14],"memoryless":[15],"channels.":[16],"The":[17,121],"are":[19,34],"based":[20,53],"on":[21,25,54],"projecting":[22],"the":[23,30,40,51,73,90,96,106,114,124,140,145],"code":[24,58,75,81],"its":[26],"cosets,":[27],"recursively":[28],"projected":[31],"(which":[33],"lower-order":[35],"RM":[36,101,128],"codes),":[37],"and":[38,57,68,79],"aggregating":[39],"reconstructions":[41],"(e.g.,":[42],"using":[43],"majority":[44],"votes).":[45],"further":[47],"provide":[48],"extensions":[49],"list-decoding":[55],"concatenation.":[59],"run":[61],"our":[62],"main":[63],"algorithm":[64,92,126],"AWGN":[66],"channels":[67],"Binary":[69],"Symmetric":[70],"Channels":[71],"at":[72],"short":[74],"length":[76],"(\u2264":[77,83],"1024)":[78],"low":[80],"rate":[82],"0.5)":[84],"regime.":[85],"Simulation":[86],"results":[87],"show":[88],"that":[89,138],"not":[93],"only":[94],"outperforms":[95,105],"previous":[97],"codes,":[102],"it":[103],"also":[104],"optimal":[107],"decoder":[108,147],"polar":[110],"(SCL+CRC)":[112],"with":[113],"same":[115],"parameters":[116],"by":[117],"wide":[119],"margin.":[120],"performance":[122],"in":[130,134],"those":[131],"regimes":[132],"is":[133],"fact":[135],"close":[136],"to":[137],"maximal":[141],"likelihood":[142],"decoder.":[143],"Finally,":[144],"naturally":[148],"allows":[149],"parallel":[151],"implementations.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":5}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}