{"id":"https://openalex.org/W4407199374","doi":"https://doi.org/10.1109/isit63088.2025.11195602","title":"Recursive Decoding of Binary Rank Reed-Muller Codes and Plotkin Construction for Matrix Codes","display_name":"Recursive Decoding of Binary Rank Reed-Muller Codes and Plotkin Construction for Matrix Codes","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4407199374","doi":"https://doi.org/10.1109/isit63088.2025.11195602"},"language":"en","primary_location":{"id":"doi:10.1109/isit63088.2025.11195602","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195602","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":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-04915230v1/file/ISIT_Submitted_Version.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063131196","display_name":"Alain Couvreur","orcid":"https://orcid.org/0000-0003-4554-6720"},"institutions":[{"id":"https://openalex.org/I142476485","display_name":"\u00c9cole Polytechnique","ror":"https://ror.org/05hy3tk52","country_code":"FR","type":"education","lineage":["https://openalex.org/I142476485","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210126360","display_name":"Inria Saclay - \u00cele de France","ror":"https://ror.org/0315e5x55","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210126360"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Alain Couvreur","raw_affiliation_strings":["&#x00C9;cole Polytechnique, Institut Polytechnique de Paris,Inria &#x0026; Laboratoire LIX, CNRS UMR 7161,Cedex,91120","GRACE - Geometry, arithmetic, algorithms, codes and encryption (Inria Saclay Ile-de-France - B\u00e2t. Alan Turing ; LIX - 2e \u00e9tage ; 1 rue Honor\u00e9 d'Estienne d'Orves ; Campus de l'\u00c9cole Polytechnique ; 91120 Palaiseau - France)"],"affiliations":[{"raw_affiliation_string":"&#x00C9;cole Polytechnique, Institut Polytechnique de Paris,Inria &#x0026; Laboratoire LIX, CNRS UMR 7161,Cedex,91120","institution_ids":["https://openalex.org/I1294671590"]},{"raw_affiliation_string":"GRACE - Geometry, arithmetic, algorithms, codes and encryption (Inria Saclay Ile-de-France - B\u00e2t. Alan Turing ; LIX - 2e \u00e9tage ; 1 rue Honor\u00e9 d'Estienne d'Orves ; Campus de l'\u00c9cole Polytechnique ; 91120 Palaiseau - France)","institution_ids":["https://openalex.org/I4210126360","https://openalex.org/I142476485"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059421971","display_name":"Rakhi Pratihar","orcid":"https://orcid.org/0000-0003-3101-183X"},"institutions":[{"id":"https://openalex.org/I4210126360","display_name":"Inria Saclay - \u00cele de France","ror":"https://ror.org/0315e5x55","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210126360"]},{"id":"https://openalex.org/I142476485","display_name":"\u00c9cole Polytechnique","ror":"https://ror.org/05hy3tk52","country_code":"FR","type":"education","lineage":["https://openalex.org/I142476485","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Rakhi Pratihar","raw_affiliation_strings":["&#x00C9;cole Polytechnique, Institut Polytechnique de Paris,Inria &#x0026; Laboratoire LIX, CNRS UMR 7161,Cedex,91120","GRACE - Geometry, arithmetic, algorithms, codes and encryption (Inria Saclay Ile-de-France - B\u00e2t. Alan Turing ; LIX - 2e \u00e9tage ; 1 rue Honor\u00e9 d'Estienne d'Orves ; Campus de l'\u00c9cole Polytechnique ; 91120 Palaiseau - France)"],"affiliations":[{"raw_affiliation_string":"&#x00C9;cole Polytechnique, Institut Polytechnique de Paris,Inria &#x0026; Laboratoire LIX, CNRS UMR 7161,Cedex,91120","institution_ids":["https://openalex.org/I1294671590"]},{"raw_affiliation_string":"GRACE - Geometry, arithmetic, algorithms, codes and encryption (Inria Saclay Ile-de-France - B\u00e2t. Alan Turing ; LIX - 2e \u00e9tage ; 1 rue Honor\u00e9 d'Estienne d'Orves ; Campus de l'\u00c9cole Polytechnique ; 91120 Palaiseau - France)","institution_ids":["https://openalex.org/I4210126360","https://openalex.org/I142476485"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063131196"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I142476485","https://openalex.org/I4210126360"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00849062,"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/T11130","display_name":"Coding theory and cryptography","score":0.9966999888420105,"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"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9966999888420105,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9965999722480774,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9962000250816345,"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/rank","display_name":"Rank (graph theory)","score":0.6458994150161743},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6453288197517395},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.5090148448944092},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5045095682144165},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4872256815433502},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.45770028233528137},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.38773787021636963},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3704693615436554},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35201209783554077},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.34238192439079285},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3208603858947754},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25905606150627136}],"concepts":[{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6458994150161743},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6453288197517395},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.5090148448944092},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5045095682144165},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4872256815433502},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.45770028233528137},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.38773787021636963},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3704693615436554},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35201209783554077},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.34238192439079285},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3208603858947754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25905606150627136},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit63088.2025.11195602","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195602","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"},{"id":"pmh:oai:HAL:hal-04915230v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-04915230v1/document","pdf_url":"https://inria.hal.science/hal-04915230v1/file/ISIT_Submitted_Version.pdf","source":{"id":"https://openalex.org/S4406922454","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2025","raw_type":"Preprints, Working Papers, ..."},{"id":"pmh:oai:HAL:hal-04915230v2","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-04915230","pdf_url":null,"source":{"id":"https://openalex.org/S4406922454","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT), Jun 2025, Ann Arbor, United States. pp.1-6, &#x27E8;10.1109/ISIT63088.2025.11195602&#x27E9;","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-04915230v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-04915230v1/document","pdf_url":"https://inria.hal.science/hal-04915230v1/file/ISIT_Submitted_Version.pdf","source":{"id":"https://openalex.org/S4406922454","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2025","raw_type":"Preprints, Working Papers, ..."},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4407199374.pdf","grobid_xml":"https://content.openalex.org/works/W4407199374.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3133831695","https://openalex.org/W2037763716","https://openalex.org/W2100149990","https://openalex.org/W1968396483","https://openalex.org/W4297536019","https://openalex.org/W1798117689","https://openalex.org/W58580312","https://openalex.org/W2169737172","https://openalex.org/W4311033648","https://openalex.org/W2151937123"],"abstract_inverted_index":{"We":[0,80],"give":[1],"a":[2,34,48,64,76,83],"recursive":[3,40,60],"decoding":[4,41,51,84],"algorithm":[5,42,52,85],"of":[6,37,67],"the":[7,22,59],"rank":[8,69],"metric":[9,70],"Reed-Muller":[10],"codes":[11,71],"introduced":[12],"by":[13],"Augot,":[14],"Couvreur,":[15],"Lavauzelle":[16],"and":[17],"Neri":[18],"in":[19],"2021":[20],"for":[21],"binary":[23],"case,":[24],"i.e.,":[25],"<tex":[26],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[27],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathbf{G}=":[28],"(\\mathbb{Z}":[29],"/":[30],"2":[31],"\\mathbb{Z})^{m}$</tex>.":[32],"In":[33],"broad":[35],"range":[36],"parameters,":[38],"this":[39,88],"has":[43],"better":[44],"complexity":[45],"compared":[46],"to":[47,87],"recently":[49],"proposed":[50],"based":[53],"on":[54],"Dickson":[55],"matrices.":[56],"Furthermore,":[57],"imitating":[58],"structure,":[61],"we":[62],"introduce":[63],"Plotkin-like":[65],"construction":[66],"matrix":[68],"over":[72],"finite":[73],"fields":[74],"answering":[75],"long-standing":[77],"open":[78],"question.":[79],"also":[81],"provide":[82],"associated":[86],"construction.":[89]},"counts_by_year":[],"updated_date":"2026-03-14T08:43:22.919905","created_date":"2025-02-06T00:00:00"}