112 search results - page 7 / 23 » On the Homological Dimension of Lattices |
JMLR
2012
11 years 9 months ago
2012
Often, high dimensional data lie close to a low-dimensional submanifold and it is of interest to understand the geometry of these submanifolds. The homology groups of a manifold a...
SYRCODIS
2007
13 years 7 months ago
2007
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
AFRICACRYPT
2010
Springer
14 years 1 months ago
2010
Springer
In this paper we present an algorithm for parallel exhaustive search for short vectors in lattices. This algorithm can be applied to a wide range of parallel computing systems. To ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...
SIAMDM
2010
13 years 5 months ago
2010
This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes in Rn . We show that the minimum distance is multipli...