{"id":"https://openalex.org/W1518498106","doi":"https://doi.org/10.1007/978-3-642-03685-9_26","title":"Deterministic Approximation Algorithms for the Nearest Codeword Problem","display_name":"Deterministic Approximation Algorithms for the Nearest Codeword Problem","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1518498106","doi":"https://doi.org/10.1007/978-3-642-03685-9_26","mag":"1518498106"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-03685-9_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03685-9_26","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5083469386","display_name":"Noga Alon","orcid":"https://orcid.org/0000-0003-1332-4883"},"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"]},{"id":"https://openalex.org/I4210125051","display_name":"Microsoft (Israel)","ror":"https://ror.org/03819cc96","country_code":"IL","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210125051"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Noga Alon","raw_affiliation_strings":["Institute for Advanced Study, Microsoft, Tel Aviv University, Israel"],"affiliations":[{"raw_affiliation_string":"Institute for Advanced Study, Microsoft, Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192","https://openalex.org/I4210125051"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085651536","display_name":"Rina Panigrahy\u200e","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rina Panigrahy","raw_affiliation_strings":["Microsoft Research Silicon Valley, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Silicon Valley, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046685409","display_name":"Sergey Yekhanin","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sergey Yekhanin","raw_affiliation_strings":["Microsoft Research Silicon Valley, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Silicon Valley, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083469386"],"corresponding_institution_ids":["https://openalex.org/I16391192","https://openalex.org/I4210125051"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.9457,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.94161337,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"339","last_page":"351"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10237","display_name":"Cryptography and Data Security","score":0.9991999864578247,"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/T11130","display_name":"Coding theory and cryptography","score":0.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6308550238609314},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6190474033355713},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.6063295602798462},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.5838483572006226},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5379588603973389},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.5166507363319397},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5133480429649353},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4981412887573242},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49508562684059143},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47439196705818176},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.4648313522338867},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44854870438575745},{"id":"https://openalex.org/keywords/linear-space","display_name":"Linear space","score":0.43967145681381226},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4321162700653076},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4192257523536682},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2732466459274292},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.09640383720397949}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6308550238609314},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6190474033355713},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.6063295602798462},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.5838483572006226},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5379588603973389},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5166507363319397},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5133480429649353},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4981412887573242},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49508562684059143},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47439196705818176},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4648313522338867},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44854870438575745},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.43967145681381226},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4321162700653076},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4192257523536682},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2732466459274292},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.09640383720397949},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-03685-9_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03685-9_26","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1530008367","https://openalex.org/W1996146326","https://openalex.org/W2000333212","https://openalex.org/W2008671178","https://openalex.org/W2029734507","https://openalex.org/W2064269488","https://openalex.org/W2082349572","https://openalex.org/W2132302072","https://openalex.org/W2169665116","https://openalex.org/W2171001107","https://openalex.org/W3014312596","https://openalex.org/W3144422206"],"related_works":["https://openalex.org/W4313227037","https://openalex.org/W4307416302","https://openalex.org/W2271516095","https://openalex.org/W1952648253","https://openalex.org/W2099732033","https://openalex.org/W1829226603","https://openalex.org/W2964478421","https://openalex.org/W3090085599","https://openalex.org/W1518498106","https://openalex.org/W2922095319"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}