{"id":"https://openalex.org/W1985862992","doi":"https://doi.org/10.1145/2608628.2608660","title":"Sparse polynomial interpolation codes and their decoding beyond half the minimum distance","display_name":"Sparse polynomial interpolation codes and their decoding beyond half the minimum distance","publication_year":2014,"publication_date":"2014-07-01","ids":{"openalex":"https://openalex.org/W1985862992","doi":"https://doi.org/10.1145/2608628.2608660","mag":"1985862992"},"language":"en","primary_location":{"id":"doi:10.1145/2608628.2608660","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2608628.2608660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1403.3594","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Erich L. Kaltofen","orcid":null},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Erich L. Kaltofen","raw_affiliation_strings":["NCSU Raleigh, NC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NCSU Raleigh, NC","institution_ids":["https://openalex.org/I137902535"]}]},{"author_position":"last","author":{"id":null,"display_name":"Cl\u00e9ment Pernet","orcid":null},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Cl\u00e9ment Pernet","raw_affiliation_strings":["U. J. Fourier, LIP-AriC, CNRS, Inria, UCBL, \u00c9NS de Lyon, Lyon Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"U. J. Fourier, LIP-AriC, CNRS, Inria, UCBL, \u00c9NS de Lyon, Lyon Cedex, France","institution_ids":["https://openalex.org/I100532134","https://openalex.org/I1326498283","https://openalex.org/I1294671590","https://openalex.org/I113428412"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8458,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.80433001,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"272","last_page":"279"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"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.9995999932289124,"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.6733999848365784},{"id":"https://openalex.org/keywords/interpolation","display_name":"Interpolation (computer graphics)","score":0.6186000108718872},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5338000059127808},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5034000277519226},{"id":"https://openalex.org/keywords/polynomial-interpolation","display_name":"Polynomial interpolation","score":0.474700003862381},{"id":"https://openalex.org/keywords/linear-interpolation","display_name":"Linear interpolation","score":0.42160001397132874},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.4214000105857849}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6909000277519226},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6733999848365784},{"id":"https://openalex.org/C137800194","wikidata":"https://www.wikidata.org/wiki/Q11713455","display_name":"Interpolation (computer graphics)","level":3,"score":0.6186000108718872},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6044999957084656},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5338000059127808},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5034000277519226},{"id":"https://openalex.org/C88080468","wikidata":"https://www.wikidata.org/wiki/Q637347","display_name":"Polynomial interpolation","level":4,"score":0.474700003862381},{"id":"https://openalex.org/C171836373","wikidata":"https://www.wikidata.org/wiki/Q2266329","display_name":"Linear interpolation","level":3,"score":0.42160001397132874},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.4214000105857849},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.32739999890327454},{"id":"https://openalex.org/C199163554","wikidata":"https://www.wikidata.org/wiki/Q1681619","display_name":"Univariate","level":3,"score":0.3133000135421753},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30790001153945923},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.2939000129699707},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2903999984264374},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.28529998660087585},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.2614000141620636}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2608628.2608660","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2608628.2608660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1403.3594","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1403.3594","pdf_url":"https://arxiv.org/pdf/1403.3594","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-01068308v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01068308","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSAC - 39th International Symposium on Symbolic and Algebraic Computation, Jul 2014, Kobe, Japan. pp. 272-279, ⟨10.1145/2608628.2608660⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1403.3594","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1403.3594","pdf_url":"https://arxiv.org/pdf/1403.3594","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4237839936","display_name":null,"funder_award_id":"CCF-1115772 (Kaltofen)","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G7353719118","display_name":null,"funder_award_id":"HPAC ANR-11-BS02-013","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1587463886","https://openalex.org/W1977375620","https://openalex.org/W2026317840","https://openalex.org/W2028186291","https://openalex.org/W2065263603","https://openalex.org/W2070279173","https://openalex.org/W2080553743","https://openalex.org/W2083005904","https://openalex.org/W2083613288","https://openalex.org/W2100899126","https://openalex.org/W2108900323","https://openalex.org/W2116774465","https://openalex.org/W2123500455","https://openalex.org/W2126318803","https://openalex.org/W2129638195","https://openalex.org/W2133040107","https://openalex.org/W2162442687","https://openalex.org/W2167854544","https://openalex.org/W2335400162","https://openalex.org/W6681722003"],"related_works":[],"abstract_inverted_index":{"We":[0],"present":[1],"algorithms":[2],"performing":[3],"sparse":[4,32],"univariate":[5],"polynomial":[6,33],"interpolation":[7,34],"with":[8],"errors":[9],"in":[10],"the":[11,14,18,31,44,50,66,76],"evaluations":[12],"of":[13],"polynomial.":[15],"Based":[16],"on":[17],"initial":[19],"work":[20],"by":[21,48],"Comer,":[22],"Kaltofen":[23],"and":[24,36,69],"Pernet":[25],"[Proc.":[26],"ISSAC":[27,53],"2012],":[28],"we":[29,55],"define":[30],"codes":[35],"state":[37],"that":[38],"their":[39],"minimal":[40,67,77],"distance":[41,68],"is":[42],"precisely":[43],"code-word":[45],"length":[46],"divided":[47],"twice":[49],"sparsity.":[51],"At":[52],"2012,":[54],"have":[56],"given":[57],"a":[58,70],"decoding":[59,72],"algorithm":[60,73],"for":[61],"as":[62,64],"much":[63],"half":[65],"list":[71],"up":[74],"to":[75],"distance.":[78]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}