{"id":"https://openalex.org/W4415368774","doi":"https://doi.org/10.1109/isit63088.2025.11195324","title":"An Upper Bound on the Error Probability of Rpa Decoding of Reed-Muller Codes Over the Bsc","display_name":"An Upper Bound on the Error Probability of Rpa Decoding of Reed-Muller Codes Over the Bsc","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368774","doi":"https://doi.org/10.1109/isit63088.2025.11195324"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195324","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195324","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087839421","display_name":"V. Arvind Rameshwar","orcid":"https://orcid.org/0000-0002-5284-215X"},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"V. Arvind Rameshwar","raw_affiliation_strings":["Indian Institute of Science,IUDX Program Unit,Bengaluru,India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Science,IUDX Program Unit,Bengaluru,India","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058930255","display_name":"V. Lalitha","orcid":null},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"V. Lalitha","raw_affiliation_strings":["Signal Processing and Communications Research Center (SPCRC), IIIT Hyderabad,India"],"affiliations":[{"raw_affiliation_string":"Signal Processing and Communications Research Center (SPCRC), IIIT Hyderabad,India","institution_ids":["https://openalex.org/I65181880"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087839421"],"corresponding_institution_ids":["https://openalex.org/I59270414"],"apc_list":null,"apc_paid":null,"fwci":1.6666,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.89139001,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9988999962806702,"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.9988999962806702,"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/T11130","display_name":"Coding theory and cryptography","score":0.996399998664856,"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.9958000183105469,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7441999912261963},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.5882999897003174},{"id":"https://openalex.org/keywords/probability-of-error","display_name":"Probability of error","score":0.5605000257492065},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5522000193595886},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5170000195503235},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.46480000019073486},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.3702999949455261}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7441999912261963},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6195999979972839},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.5882999897003174},{"id":"https://openalex.org/C92224547","wikidata":"https://www.wikidata.org/wiki/Q1673216","display_name":"Probability of error","level":2,"score":0.5605000257492065},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5522000193595886},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5170000195503235},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.46480000019073486},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4465999901294708},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4458000063896179},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.3702999949455261},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.335999995470047},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.3239000141620636},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.3111000061035156},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.287200003862381},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.28360000252723694},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.2824999988079071},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C44280652","wikidata":"https://www.wikidata.org/wiki/Q104837","display_name":"Phase (matter)","level":2,"score":0.2606000006198883},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.257999986410141}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195324","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195324","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1545614041","https://openalex.org/W2004229705","https://openalex.org/W2025948462","https://openalex.org/W2103524940","https://openalex.org/W2121417875","https://openalex.org/W2121498709","https://openalex.org/W2127074672","https://openalex.org/W2137902053","https://openalex.org/W2149250337","https://openalex.org/W2591190829","https://openalex.org/W3001795748","https://openalex.org/W3009999666","https://openalex.org/W3037718443","https://openalex.org/W3102754027","https://openalex.org/W3196996832","https://openalex.org/W3212795869","https://openalex.org/W4233413206","https://openalex.org/W4250954493","https://openalex.org/W4380679932","https://openalex.org/W4390098163"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,78],"revisit":[4],"the":[5,28,34,52,66,70,74,81,88,114,123],"Recursive":[6],"Projection-Aggregation":[7],"(RPA)":[8],"decoder,":[9,36,90],"of":[10,30,45,51,55,60,65,73,87],"Ye":[11],"and":[12,64],"Abbe":[13],"(2020),":[14],"for":[15,97,106,127],"Reed-Muller":[16],"(RM)":[17],"codes.":[18],"Our":[19,99],"main":[20],"contribution":[21],"is":[22,95],"an":[23],"explicit":[24,49],"upper":[25],"bound":[26],"on":[27,80],"probability":[29,54],"incorrect":[31],"decoding,":[32],"using":[33],"RPA":[35,75,89,115],"over":[37],"a":[38,84],"binary":[39],"symmetric":[40],"channel":[41],"(BSC).":[42],"Key":[43],"components":[44],"our":[46],"analysis":[47],"are":[48],"estimates":[50],"error":[53,67,120],"maximum":[56],"likelihood":[57],"(ML)":[58],"decoding":[59],"first-order":[61],"RM":[62,107,128],"codes":[63,108],"probabilities":[68],"during":[69],"aggregation":[71],"phase":[72],"decoder.":[76],"Importantly,":[77],"focus":[79],"events":[82],"where":[83],"single":[85],"iteration":[86],"in":[91,122,134],"each":[92],"recursive":[93],"call,":[94],"sufficient":[96],"convergence.":[98],"results":[100],"allow":[101],"us":[102],"to":[103],"show":[104],"that":[105,130],"with":[109],"blocklength":[110,125],"<tex":[111,135],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[112,136],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N=2^{m}$</tex>,":[113],"decoder":[116],"can":[117],"achieve":[118],"vanishing":[119],"probabilities,":[121],"large":[124],"limit,":[126],"orders":[129],"grow":[131],"roughly":[132],"logarithmically":[133],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$m$</tex>.":[137]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}