274 search results - page 15 / 55 » Counting lattice vectors |
DCG
2010
14 years 11 months ago
2010
The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper we reveal the face structure of the contact polytope of the Leech lattice. We classify i...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
For p n, let b (n) 1 , . . . , b (n) p be independent random vectors in Rn with the same distribution invariant by rotation and without mass at the origin. Almost surely these vec...
101
click to vote
CRYPTO
2008
Springer
15 years 1 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
ICCAD
1999
IEEE
15 years 4 months ago
1999
IEEE
We describe a method referred to as sequence counting to improve on the levels of compaction achievable by vector omission based static compaction procedures. Such procedures are ...
103
click to vote
ISCAS
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— This paper describes the first VLSI implementation of lattice reduction (LR) aided multi-antenna broadcast precoding with vector perturbation. The considered LR scheme...