{"id":"https://openalex.org/W4416513925","doi":"https://doi.org/10.1109/itw62417.2025.11240441","title":"Minimum Distance Decoding for Reed-Muller Codes using Projection-Aggregation","display_name":"Minimum Distance Decoding for Reed-Muller Codes using Projection-Aggregation","publication_year":2025,"publication_date":"2025-09-29","ids":{"openalex":"https://openalex.org/W4416513925","doi":"https://doi.org/10.1109/itw62417.2025.11240441"},"language":null,"primary_location":{"id":"doi:10.1109/itw62417.2025.11240441","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw62417.2025.11240441","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Information Theory Workshop (ITW)","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/A5100392940","display_name":"Bin Zhang","orcid":"https://orcid.org/0009-0001-9675-0345"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Bin Zhang","raw_affiliation_strings":["Beihang University,Department of Electronic and Information Engineering,Beijing,China"],"affiliations":[{"raw_affiliation_string":"Beihang University,Department of Electronic and Information Engineering,Beijing,China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013594198","display_name":"Qin Huang","orcid":"https://orcid.org/0000-0003-1621-6984"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qin Huang","raw_affiliation_strings":["Beihang University,Department of Electronic and Information Engineering,Beijing,China"],"affiliations":[{"raw_affiliation_string":"Beihang University,Department of Electronic and Information Engineering,Beijing,China","institution_ids":["https://openalex.org/I82880672"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100392940"],"corresponding_institution_ids":["https://openalex.org/I82880672"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.40106064,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"680","last_page":"685"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.6434000134468079,"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.6434000134468079,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.08760000020265579,"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.03680000081658363,"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/decoding-methods","display_name":"Decoding methods","score":0.781000018119812},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7135999798774719},{"id":"https://openalex.org/keywords/linear-subspace","display_name":"Linear subspace","score":0.6796000003814697},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.6284999847412109},{"id":"https://openalex.org/keywords/decodes","display_name":"Decodes","score":0.6010000109672546},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5472999811172485},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.4426000118255615},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.41909998655319214}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.781000018119812},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7135999798774719},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.6796000003814697},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6284999847412109},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6158000230789185},{"id":"https://openalex.org/C2778858076","wikidata":"https://www.wikidata.org/wiki/Q5249539","display_name":"Decodes","level":3,"score":0.6010000109672546},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5472999811172485},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48910000920295715},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4821000099182129},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46619999408721924},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.4426000118255615},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.41909998655319214},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3449000120162964},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.3203999996185303},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.3149999976158142},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.29919999837875366},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.2985000014305115},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.29649999737739563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29600000381469727},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.29190000891685486},{"id":"https://openalex.org/C7655956","wikidata":"https://www.wikidata.org/wiki/Q5282259","display_name":"Disjoint union (topology)","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C2776141515","wikidata":"https://www.wikidata.org/wiki/Q1274479","display_name":"Repetition (rhetorical device)","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.25450000166893005}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw62417.2025.11240441","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw62417.2025.11240441","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1965194482","https://openalex.org/W1993003751","https://openalex.org/W2004229705","https://openalex.org/W2025948462","https://openalex.org/W2103524940","https://openalex.org/W2119973130","https://openalex.org/W2121417875","https://openalex.org/W2149250337","https://openalex.org/W2909355330","https://openalex.org/W2962970830","https://openalex.org/W3001795748","https://openalex.org/W3009999666","https://openalex.org/W3035162521","https://openalex.org/W3184425224","https://openalex.org/W3196996832","https://openalex.org/W3198668109","https://openalex.org/W3214702273","https://openalex.org/W4225921667","https://openalex.org/W4226145738","https://openalex.org/W4288780551","https://openalex.org/W4309757106","https://openalex.org/W4317392398","https://openalex.org/W4391677761","https://openalex.org/W4401693463","https://openalex.org/W4402475164","https://openalex.org/W4415368774"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"shows":[2],"that":[3,34,89],"projection-aggregation":[4],"(PA)":[5],"decoding":[6,84,91],"of":[7,40,64,110],"Reed-Muller":[8],"(RM)":[9],"codes":[10,80,109],"can":[11],"decode":[12],"up":[13,97],"to":[14,29,98],"half":[15,99,114],"the":[16,23,60,71,100],"minimum":[17,101],"distance":[18,102],"d":[19,56,93],"efficiently.":[20],"By":[21],"generalizing":[22],"false":[24,49],"vote":[25],"matrix":[26],"from":[27],"1-dimensional":[28],"higher-dimensional":[30],"subspaces,":[31,38],"we":[32,87],"prove":[33,88],"projecting":[35,77],"onto":[36],"disjoint":[37,57,94],"regardless":[39],"their":[41],"dimensions,":[42],"provides":[43],"at":[44],"most":[45],"d/2":[46,65],"\u2212":[47,66],"1":[48,67],"votes":[50],"for":[51,62,107],"each":[52],"codeword":[53],"bit.":[54],"Thus,":[55],"subspaces":[58,95],"guarantee":[59],"correction":[61],"errors":[63],"or":[68,116],"less.":[69,117],"Moreover,":[70],"flexibility":[72],"in":[73,83,103],"subspace":[74],"dimensions":[75],"allows":[76],"into":[78],"repetition":[79],"directly,":[81],"resulting":[82],"efficiency.":[85],"Finally,":[86],"PA":[90],"with":[92],"decodes":[96],"$O(n\\sqrt":[104],"n":[105,112],")$":[106],"RM":[108],"length":[111],"and":[113],"rate":[115]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-11-23T00:00:00"}