Finding short vectors in a lattice of Voronoi's first kind
Information Theory
2012-01-26 v1 Data Structures and Algorithms
math.IT
Abstract
We show that for those lattices of Voronoi's first kind, a vector of shortest nonzero Euclidean length can computed in polynomial time by computing a minimum cut in a graph.
Keywords
Cite
@article{arxiv.1201.5154,
title = {Finding short vectors in a lattice of Voronoi's first kind},
author = {Robby McKilliam and Alex Grant},
journal= {arXiv preprint arXiv:1201.5154},
year = {2012}
}
Comments
submitted to the 2012 International Symposium on Information Theory (ISIT)