13 search results - page 1 / 3 » On Bounded Distance Decoding for General Lattices |
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice v represented by some basis, and a target point y, nd the lattice point close...
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
TIT
1998
13 years 4 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
A belief-propagation decoder for low-density lattice codes, which represents messages explicitly as a mixture of Gaussians functions, is given. In order to prevent the mixture elem...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
—In lattice-coded multiple-input multiple-output (MIMO) systems, optimal decoding amounts to solving the closest vector problem (CVP). Embedding is a powerful technique for the a...