{"id":"https://openalex.org/W4415368246","doi":"https://doi.org/10.1109/isit63088.2025.11195313","title":"(Quasi-)Linear-Time Algorithms for the Closest Vector Problem in (Semi-)Equiangular Lattices","display_name":"(Quasi-)Linear-Time Algorithms for the Closest Vector Problem in (Semi-)Equiangular Lattices","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368246","doi":"https://doi.org/10.1109/isit63088.2025.11195313"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195313","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195313","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5102144021","display_name":"Kenta Takahashi","orcid":"https://orcid.org/0000-0003-4542-8484"},"institutions":[{"id":"https://openalex.org/I65143321","display_name":"Hitachi (Japan)","ror":"https://ror.org/02exqgm79","country_code":"JP","type":"company","lineage":["https://openalex.org/I65143321"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kenta Takahashi","raw_affiliation_strings":["Hitachi, Ltd.,Research & Development Group,Yokohama,Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hitachi, Ltd.,Research & Development Group,Yokohama,Japan","institution_ids":["https://openalex.org/I65143321"]}]},{"author_position":"last","author":{"id":null,"display_name":"Wanaru Nakamura","orcid":null},"institutions":[{"id":"https://openalex.org/I65143321","display_name":"Hitachi (Japan)","ror":"https://ror.org/02exqgm79","country_code":"JP","type":"company","lineage":["https://openalex.org/I65143321"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Wanaru Nakamura","raw_affiliation_strings":["Hitachi, Ltd.,Research & Development Group,Yokohama,Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hitachi, Ltd.,Research & Development Group,Yokohama,Japan","institution_ids":["https://openalex.org/I65143321"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I65143321"],"apc_list":null,"apc_paid":null,"fwci":2.5254,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.89314928,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.95660001039505,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.95660001039505,"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/dual-polyhedron","display_name":"Dual polyhedron","score":0.7616000175476074},{"id":"https://openalex.org/keywords/lattice","display_name":"Lattice (music)","score":0.7102000117301941},{"id":"https://openalex.org/keywords/checkerboard","display_name":"Checkerboard","score":0.5795999765396118},{"id":"https://openalex.org/keywords/lattice-reduction","display_name":"Lattice reduction","score":0.36809998750686646},{"id":"https://openalex.org/keywords/lattice-problem","display_name":"Lattice problem","score":0.2937000095844269},{"id":"https://openalex.org/keywords/vector-space","display_name":"Vector space","score":0.290800005197525}],"concepts":[{"id":"https://openalex.org/C105313907","wikidata":"https://www.wikidata.org/wiki/Q1053857","display_name":"Dual polyhedron","level":2,"score":0.7616000175476074},{"id":"https://openalex.org/C2781204021","wikidata":"https://www.wikidata.org/wiki/Q6497091","display_name":"Lattice (music)","level":2,"score":0.7102000117301941},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6007000207901001},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5799000263214111},{"id":"https://openalex.org/C2779168147","wikidata":"https://www.wikidata.org/wiki/Q460711","display_name":"Checkerboard","level":2,"score":0.5795999765396118},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48510000109672546},{"id":"https://openalex.org/C44274781","wikidata":"https://www.wikidata.org/wiki/Q6497132","display_name":"Lattice reduction","level":4,"score":0.36809998750686646},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35899999737739563},{"id":"https://openalex.org/C168482242","wikidata":"https://www.wikidata.org/wiki/Q6497128","display_name":"Lattice problem","level":3,"score":0.2937000095844269},{"id":"https://openalex.org/C13336665","wikidata":"https://www.wikidata.org/wiki/Q125977","display_name":"Vector space","level":2,"score":0.290800005197525},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.28209999203681946},{"id":"https://openalex.org/C142885752","wikidata":"https://www.wikidata.org/wiki/Q1252145","display_name":"Integer lattice","level":3,"score":0.2743000090122223},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2700999975204468},{"id":"https://openalex.org/C75577371","wikidata":"https://www.wikidata.org/wiki/Q6497124","display_name":"Lattice model (finance)","level":3,"score":0.26429998874664307},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2630000114440918}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195313","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195313","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1512015702","https://openalex.org/W1624710162","https://openalex.org/W1966648469","https://openalex.org/W2094837187","https://openalex.org/W2111809688","https://openalex.org/W2116631972","https://openalex.org/W2127671126","https://openalex.org/W2315723423","https://openalex.org/W3081347490","https://openalex.org/W3204935890","https://openalex.org/W3211639626","https://openalex.org/W4206558398","https://openalex.org/W4233469339","https://openalex.org/W4241011531","https://openalex.org/W4292414116"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"study,":[2],"we":[3,29],"define":[4],"two":[5],"novel":[6,17],"classes":[7],"of":[8],"lattices:":[9],"the":[10,21,38,49,57],"equiangular":[11],"lattice$\\mathcal{E}_{n}$and":[12],"semi-equiangular":[13],"lattice$\\tilde{\\mathcal{E}}_{n}$.":[14],"We":[15],"propose":[16],"algorithms":[18,32],"for":[19,34],"solving":[20],"closest":[22],"vector":[23],"problem":[24],"in$\\mathcal{E}_{n}$and$\\mathcal{E}_{n}$in$O(n":[25],"\\log":[26],"n)$time.":[27],"Furthermore,":[28],"develop":[30],"improved":[31],"with$O(n)$time":[33],"slightly":[35],"restricted":[36],"classes.$\\mathcal{E}_{n}$includes":[37],"well-studied":[39],"root":[40,47],"lattice$A_{n}$and":[41],"its":[42,53],"dual,$A_{n}^{*}.":[43],"\\tilde{\\mathcal{E}}_{n}$includes":[44],"another":[45],"important":[46,63],"lattice$D_{n}$(or":[48],"checkerboard":[50],"lattice)":[51],"and":[52],"dual,$D_{n}^{*}.":[54],"\\tilde{\\mathcal{E}}_{n}$also":[55],"includes":[56,61],"Coxeter-Barnes":[58],"lattice$A_{n}^{r}$,":[59],"which":[60],"many":[62],"lattices":[64],"lying":[65],"between$A_{n}$and$A_{n}^{*}$,":[66],"including$A_{n},":[67],"E_{7},":[68],"E_{8}$and":[69],"their":[70],"duals$A_{n}^{*},":[71],"E_{7}^{*},":[72],"E_{8}^{*}$.":[73]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-21T00:00:00"}