{"id":"https://openalex.org/W2922407258","doi":"https://doi.org/10.23919/isita.2018.8664371","title":"The Double-Plane Algorithm: A simple algorithm for the closest vector problem","display_name":"The Double-Plane Algorithm: A simple algorithm for the closest vector problem","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2922407258","doi":"https://doi.org/10.23919/isita.2018.8664371","mag":"2922407258"},"language":"en","primary_location":{"id":"doi:10.23919/isita.2018.8664371","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664371","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","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/A5071998067","display_name":"Ferdinand Blomqvist","orcid":null},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Ferdinand Blomqvist","raw_affiliation_strings":["Department of Mathematics and System Analysis, Aalto University, Espoo, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and System Analysis, Aalto University, Espoo, Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056687416","display_name":"Marcus Greferath","orcid":"https://orcid.org/0000-0002-3102-4350"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Marcus Greferath","raw_affiliation_strings":["Department of Mathematics and System Analysis, Aalto University, Espoo, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and System Analysis, Aalto University, Espoo, Finland","institution_ids":["https://openalex.org/I9927081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071998067"],"corresponding_institution_ids":["https://openalex.org/I9927081"],"apc_list":null,"apc_paid":null,"fwci":0.1629,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62232908,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"193","last_page":"197"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"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.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973999857902527,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9966999888420105,"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/algorithm","display_name":"Algorithm","score":0.8100330233573914},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7867422103881836},{"id":"https://openalex.org/keywords/ramer\u2013douglas\u2013peucker-algorithm","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","score":0.5164785385131836},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.4733417332172394},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.45224273204803467},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4492810368537903},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.43700236082077026},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42322009801864624},{"id":"https://openalex.org/keywords/lattice","display_name":"Lattice (music)","score":0.42060866951942444},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.10507762432098389}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.8100330233573914},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7867422103881836},{"id":"https://openalex.org/C75930677","wikidata":"https://www.wikidata.org/wiki/Q1251950","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","level":3,"score":0.5164785385131836},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.4733417332172394},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.45224273204803467},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4492810368537903},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.43700236082077026},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42322009801864624},{"id":"https://openalex.org/C2781204021","wikidata":"https://www.wikidata.org/wiki/Q6497091","display_name":"Lattice (music)","level":2,"score":0.42060866951942444},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.10507762432098389},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/isita.2018.8664371","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664371","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","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":13,"referenced_works":["https://openalex.org/W1624710162","https://openalex.org/W1997002146","https://openalex.org/W2015450103","https://openalex.org/W2101362102","https://openalex.org/W2111416661","https://openalex.org/W2126483728","https://openalex.org/W2132302072","https://openalex.org/W2140940105","https://openalex.org/W2141040012","https://openalex.org/W2156787051","https://openalex.org/W2277042122","https://openalex.org/W4249167178","https://openalex.org/W6680109655"],"related_works":["https://openalex.org/W3008339103","https://openalex.org/W2404647514","https://openalex.org/W1667647204","https://openalex.org/W3119814709","https://openalex.org/W2018477250","https://openalex.org/W1508895727","https://openalex.org/W4241418540","https://openalex.org/W2725786787","https://openalex.org/W4283160672","https://openalex.org/W1590965489"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,50],"new":[3],"algorithm":[4,12,17,29,39,55,81],"for":[5,58],"solving":[6],"the":[7,15,35,38,42,45,54,79,91,96,98,101,103,105,108],"closest":[8],"vector":[9],"problem.":[10],"The":[11,28,75],"is":[13,20,30,82],"called":[14],"double-plane":[16,80],"and":[18,34,64,95],"it":[19],"an":[21,31],"extension":[22],"of":[23,37,44,60,78,87,100,110],"Babai's":[24],"nearest":[25],"plane":[26],"algorithm.":[27],"approximative":[32],"algorithm,":[33],"performance":[36],"depends":[40],"on":[41],"quality":[43,52],"lattice":[46],"basis.":[47],"However,":[48],"given":[49],"high":[51],"basis,":[53],"achieves":[56],"correctness":[57,69],"lattices":[59],"sufficiently":[61],"low":[62,66],"rank,":[63],"very":[65],"error-rates":[67],"when":[68],"can":[70],"no":[71],"longer":[72],"be":[73],"achieved.":[74],"computational":[76],"complexity":[77],"upper":[83],"bounded":[84],"by":[85],"that":[86],"sphere":[88],"decoding":[89,112],"using":[90],"Schnorr-Euchner":[92],"enumeration":[93],"strategy,":[94],"higher":[97],"rank":[99],"lattice,":[102],"larger":[104],"gap":[106],"between":[107],"complexities":[109],"these":[111],"algorithms.":[113]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}