{"id":"https://openalex.org/W4396950002","doi":"https://doi.org/10.1109/tit.2024.3402171","title":"Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes","display_name":"Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes","publication_year":2024,"publication_date":"2024-05-16","ids":{"openalex":"https://openalex.org/W4396950002","doi":"https://doi.org/10.1109/tit.2024.3402171"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2024.3402171","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2024.3402171","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/A5085150941","display_name":"Itzhak Tamo","orcid":"https://orcid.org/0000-0002-8000-0419"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Itzhak Tamo","raw_affiliation_strings":["Department of Electrical Engineering–Systems, Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering–Systems, Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5085150941"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":3.4759,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.93020748,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"70","issue":"12","first_page":"8659","last_page":"8668"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998000264167786,"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.9998000264167786,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9889000058174133,"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"}},{"id":"https://openalex.org/T13182","display_name":"Quantum-Dot Cellular Automata","score":0.9866999983787537,"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/list-decoding","display_name":"List decoding","score":0.7109217643737793},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.6835300922393799},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.613903820514679},{"id":"https://openalex.org/keywords/multiplicity","display_name":"Multiplicity (mathematics)","score":0.609272837638855},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5619642734527588},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5602124929428101},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.39271047711372375},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3845464587211609},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3764655292034149},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36364537477493286},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35909438133239746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3441528081893921},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.337917298078537},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.327178955078125}],"concepts":[{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7109217643737793},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.6835300922393799},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.613903820514679},{"id":"https://openalex.org/C156004811","wikidata":"https://www.wikidata.org/wiki/Q2228257","display_name":"Multiplicity (mathematics)","level":2,"score":0.609272837638855},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5619642734527588},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5602124929428101},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.39271047711372375},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3845464587211609},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3764655292034149},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36364537477493286},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35909438133239746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3441528081893921},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.337917298078537},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.327178955078125},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2024.3402171","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2024.3402171","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2863868470","display_name":null,"funder_award_id":"852953","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W2013452229","https://openalex.org/W2024011363","https://openalex.org/W2052755788","https://openalex.org/W2065853216","https://openalex.org/W2089272132","https://openalex.org/W2098081605","https://openalex.org/W2107764994","https://openalex.org/W2125835953","https://openalex.org/W2133589924","https://openalex.org/W2146078064","https://openalex.org/W2148575324","https://openalex.org/W2162725776","https://openalex.org/W2611959999","https://openalex.org/W4205550388","https://openalex.org/W4205919716","https://openalex.org/W4245315238","https://openalex.org/W4380741288","https://openalex.org/W4386075197","https://openalex.org/W4390097886","https://openalex.org/W4390576835","https://openalex.org/W4399522383","https://openalex.org/W6676144961","https://openalex.org/W6770087808","https://openalex.org/W6852520992"],"related_works":["https://openalex.org/W2121777163","https://openalex.org/W1548705449","https://openalex.org/W2133789648","https://openalex.org/W2247418595","https://openalex.org/W2066795426","https://openalex.org/W2359973017","https://openalex.org/W2050784748","https://openalex.org/W2255105136","https://openalex.org/W2157055070","https://openalex.org/W2963132315"],"abstract_inverted_index":{"Folded":[0],"Reed-Solomon":[1],"(FRS)":[2],"and":[3,75],"univariate":[4],"multiplicity":[5],"codes":[6,10,21,96],"are":[7],"prominent":[8],"polynomial":[9],"over":[11,109],"finite":[12],"fields":[13],"renowned":[14],"for":[15,44,85,103],"achieving":[16],"list":[17,42,45,105],"decoding":[18,46,88],"capacity.":[19],"These":[20],"have":[22],"found":[23],"many":[24],"applications":[25],"beyond":[26],"the":[27,41,65,68,99,115],"traditional":[28],"scope":[29],"of":[30,106,119],"coding":[31],"theory.":[32],"In":[33],"this":[34,123],"paper,":[35],"we":[36,57,81],"introduce":[37],"improved":[38],"bounds":[39,84],"on":[40,67],"size":[43,107],"these":[47],"codes,":[48],"achieved":[49],"through":[50],"a":[51,86,104,110,120],"more":[52],"streamlined":[53],"proof":[54],"method.":[55],"Additionally,":[56],"refine":[58],"an":[59],"existing":[60],"randomized":[61],"algorithm":[62],"to":[63],"output":[64],"codewords":[66],"list,":[69],"which":[70],"enhances":[71],"its":[72,77],"success":[73],"probability":[74],"reduces":[76],"running":[78],"time.":[79],"Lastly,":[80],"establish":[82],"list-size":[83],"fixed":[87],"parameter.":[89],"Notably,":[90],"our":[91],"results":[92],"demonstrate":[93],"that":[94],"FRS":[95],"asymptotically":[97],"attain":[98],"generalized":[100],"Singleton":[101],"bound":[102],"2":[108],"relatively":[111],"small":[112],"alphabet,":[113],"marking":[114],"first":[116],"explicit":[117],"instance":[118],"code":[121],"with":[122],"property.":[124]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":1}],"updated_date":"2025-12-19T19:40:27.379048","created_date":"2025-10-10T00:00:00"}