The closest vector problem on some lattices

Haibin Kan, Hong Shen, Hong Zhu

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

The closest vector problem for general lattices is NP-hard. However, we can efficiently find the closest lattice points for some special lattices, such as root lattices (An, Dn and some En). In this paper, we discuss the closest vector problem on more general lattices than root lattices.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsMinglu Li, Qianni Deng, Xian-He Sun, Jun Ni
PublisherSpringer Verlag
Pages446-449
Number of pages4
ISBN (Print)3540219935, 9783540219934
DOIs
Publication statusPublished - 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3033
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Closest vector
  • Dual lattice
  • Lattice
  • Root lattice

Fingerprint

Dive into the research topics of 'The closest vector problem on some lattices'. Together they form a unique fingerprint.

Cite this