{"id":"https://openalex.org/W1649485448","doi":"https://doi.org/10.1109/isit.2015.7282988","title":"On the NP-hardness of bounded distance decoding of Reed-Solomon codes","display_name":"On the NP-hardness of bounded distance decoding of Reed-Solomon codes","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1649485448","doi":"https://doi.org/10.1109/isit.2015.7282988","mag":"1649485448"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282988","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282988","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 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/A5089321118","display_name":"Venkata Gandikota","orcid":"https://orcid.org/0000-0003-2381-7788"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Venkata Gandikota","raw_affiliation_strings":["Purdue University","Purdue University , USA"],"affiliations":[{"raw_affiliation_string":"Purdue University","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Purdue University , USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102807325","display_name":"Badih Ghazi","orcid":"https://orcid.org/0009-0004-1555-5321"},"institutions":[{"id":"https://openalex.org/I4210109586","display_name":"Moscow Institute of Thermal Technology","ror":"https://ror.org/021es5e59","country_code":"RU","type":"facility","lineage":["https://openalex.org/I4210109586"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Badih Ghazi","raw_affiliation_strings":["MIT","MIT,USA"],"affiliations":[{"raw_affiliation_string":"MIT","institution_ids":["https://openalex.org/I4210109586"]},{"raw_affiliation_string":"MIT,USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090091569","display_name":"Elena Grigorescu","orcid":"https://orcid.org/0000-0001-9673-4313"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Elena Grigorescu","raw_affiliation_strings":["Purdue University","Purdue University , USA"],"affiliations":[{"raw_affiliation_string":"Purdue University","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Purdue University , USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089321118"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":2.1572,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.89728251,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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":1.0,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9980000257492065,"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/code-word","display_name":"Code word","score":0.73774254322052},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5879181623458862},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5851803421974182},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5804672241210938},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.5635576248168945},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5420220494270325},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.528506338596344},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5259480476379395},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5211386680603027},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.5110510587692261},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.498492956161499},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4703429341316223},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.44305065274238586},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.30664950609207153},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21626698970794678},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20026057958602905},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.18891289830207825},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05784067511558533}],"concepts":[{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.73774254322052},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5879181623458862},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5851803421974182},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5804672241210938},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.5635576248168945},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5420220494270325},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.528506338596344},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5259480476379395},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5211386680603027},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.5110510587692261},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.498492956161499},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4703429341316223},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.44305065274238586},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.30664950609207153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21626698970794678},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20026057958602905},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.18891289830207825},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05784067511558533},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2015.7282988","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282988","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 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":11,"referenced_works":["https://openalex.org/W1551177513","https://openalex.org/W1565759886","https://openalex.org/W2032431003","https://openalex.org/W2046947513","https://openalex.org/W2080661877","https://openalex.org/W2089272132","https://openalex.org/W2103236224","https://openalex.org/W2110614437","https://openalex.org/W2166566648","https://openalex.org/W3023478445","https://openalex.org/W3111297213"],"related_works":["https://openalex.org/W2083307409","https://openalex.org/W2378000016","https://openalex.org/W2132376394","https://openalex.org/W2083005904","https://openalex.org/W2951591976","https://openalex.org/W2133789648","https://openalex.org/W2176772360","https://openalex.org/W2551681189","https://openalex.org/W2121777163","https://openalex.org/W2157055070"],"abstract_inverted_index":{"Guruswami":[0,97],"and":[1,22,25,98,123],"Vardy":[2,99],"(IEEE":[3],"Trans.":[4],"Inf.":[5],"Theory,":[6],"2005)":[7],"show":[8],"that":[9,47,102,113,172],"given":[10,26],"a":[11,15,27,45,111,159],"Reed-Solomon":[12,87],"code":[13],"over":[14],"finite":[16],"field":[17],"F,":[18],"of":[19,63,72,86,96,110,141,151,158,162,175],"length":[20],"n":[21,54,118,125,144],"dimension":[23],"k,":[24],"target":[28,76],"vector":[29],"v":[30,50,116],"\u03b5":[31],"F":[32],"<sup":[33],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[34],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sup>":[35],",":[36],"it":[37,103],"is":[38,44,78,104,154],"NP-hard":[39,105],"to":[40,106,166],"decide":[41,107],"if":[42],"there":[43],"codeword":[46,112],"disagrees":[48,114],"with":[49,115],"on":[51,117,124],"at":[52],"most":[53],"-":[55,57,119,121,126,128,145,147],"k":[56,120,127,146],"1":[58],"coordinates.":[59,130],"Understanding":[60],"the":[61,70,75,84,94,108,156,163],"complexity":[62],"this":[64,90],"Bounded":[65],"Distance":[66],"Decoding":[67],"problem":[68,82,165],"as":[69],"amount":[71,140],"error":[73,142],"in":[74,83],"decreases":[77],"an":[79,139],"important":[80],"open":[81],"study":[85],"codes.":[88],"In":[89],"work,":[91],"we":[92],"extend":[93],"result":[95],"by":[100],"proving":[101],"existence":[109],"2,":[122],"3":[129],"No":[131],"other":[132],"NP-hardness":[133,157],"results":[134],"were":[135],"known":[136],"before":[137],"for":[138],"<;":[143],"1.":[148],"The":[149],"core":[150],"our":[152],"proofs":[153],"showing":[155],"parameterized":[160],"generalization":[161],"Subset-Sum":[164],"higher":[167],"degrees":[168],"(called":[169],"Moments":[170],"Subset-Sum)":[171],"may":[173],"be":[174],"independent":[176],"interest.":[177]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}