{"id":"https://openalex.org/W2977107755","doi":"https://doi.org/10.1109/isit.2019.8849214","title":"Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel","display_name":"Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2977107755","doi":"https://doi.org/10.1109/isit.2019.8849214","mag":"2977107755"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849214","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849214","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":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/handle/20.500.14299/162374","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101961435","display_name":"Kirill Ivanov","orcid":"https://orcid.org/0000-0003-2621-7403"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Kirill Ivanov","raw_affiliation_strings":["School of Computer and Communication Sciences EPFL, Lausanne, CH-1015, Switzerland","School of Computer and Communication Sciences EPFL, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"School of Computer and Communication Sciences EPFL, Lausanne, CH-1015, Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"School of Computer and Communication Sciences EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058759310","display_name":"R\u00fcdiger Urbanke","orcid":"https://orcid.org/0000-0002-4839-821X"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"R\u00fcdiger Urbanke","raw_affiliation_strings":["School of Computer and Communication Sciences EPFL, Lausanne, CH-1015, Switzerland","School of Computer and Communication Sciences EPFL, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"School of Computer and Communication Sciences EPFL, Lausanne, CH-1015, Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"School of Computer and Communication Sciences EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101961435"],"corresponding_institution_ids":["https://openalex.org/I5124864"],"apc_list":null,"apc_paid":null,"fwci":2.4091,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.90001038,"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":"21","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"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.9997000098228455,"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.9986000061035156,"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.9979000091552734,"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.8200237154960632},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.7649722099304199},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.721000611782074},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6085013747215271},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.6032652854919434},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5984107255935669},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5412125587463379},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.5253971219062805},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4929325580596924},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.4575265347957611},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.42775923013687134},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.41331273317337036},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.4123591482639313},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38189828395843506},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3278670907020569},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.29792115092277527},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.2292931079864502},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.21086689829826355},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.20579609274864197},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07008379697799683}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8200237154960632},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.7649722099304199},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.721000611782074},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6085013747215271},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.6032652854919434},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5984107255935669},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5412125587463379},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.5253971219062805},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4929325580596924},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.4575265347957611},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.42775923013687134},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.41331273317337036},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.4123591482639313},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38189828395843506},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3278670907020569},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.29792115092277527},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2292931079864502},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.21086689829826355},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.20579609274864197},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07008379697799683},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2019.8849214","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849214","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"},{"id":"pmh:oai:infoscience.epfl.ch:271631","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/162374","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"conference proceedings"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:271631","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/162374","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"conference proceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2004229705","https://openalex.org/W2025948462","https://openalex.org/W2105667172","https://openalex.org/W2119461808","https://openalex.org/W2121417875","https://openalex.org/W2134750166","https://openalex.org/W2155995390","https://openalex.org/W2267240316","https://openalex.org/W2296617692","https://openalex.org/W2811124737","https://openalex.org/W2963024133","https://openalex.org/W2963415185","https://openalex.org/W2963684844","https://openalex.org/W2964126297","https://openalex.org/W3037975779"],"related_works":["https://openalex.org/W2370284973","https://openalex.org/W2385322349","https://openalex.org/W2383267581","https://openalex.org/W2162141500","https://openalex.org/W2028976748","https://openalex.org/W2369600518","https://openalex.org/W2085052822","https://openalex.org/W2357077655","https://openalex.org/W2042522304","https://openalex.org/W2141877208"],"abstract_inverted_index":{"In":[0],"this":[1,58],"paper,":[2],"we":[3],"consider":[4],"the":[5,44,67],"problem":[6],"of":[7,37,46,55],"decoding":[8,31,64,76],"Reed-Muller":[9],"(RM)":[10],"codes":[11],"in":[12],"binary":[13],"erasure":[14,47],"channel.":[15],"We":[16],"propose":[17],"a":[18],"novel":[19],"algorithm,":[20],"which":[21],"exploits":[22],"several":[23],"techniques,":[24],"such":[25],"as":[26,41,43],"list":[27,63],"recursive":[28],"(successive":[29],"cancellation)":[30],"based":[32],"on":[33],"Plotkin":[34],"decomposition,":[35],"permutations":[36],"encoding":[38],"factor":[39],"graph":[40],"well":[42],"properties":[45],"channels.We":[48],"show":[49],"that":[50,74],"with":[51,80],"properly":[52],"selected":[53],"number":[54],"random":[56],"permutations,":[57],"algorithm":[59],"considerably":[60],"outperforms":[61],"straightforward":[62],"while":[65],"maintaining":[66],"same":[68],"asymptotic":[69],"complexity.":[70],"This":[71],"also":[72],"means":[73],"near-MAP":[75],"can":[77],"be":[78],"achieved":[79],"lower":[81],"complexity":[82],"cost.":[83]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":2}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}