11 search results - page 2 / 3 » On the Complexity of Decoding Lattices Using the Korkin-Zolo... |
CORR
2007
Springer
13 years 5 months ago
2007
Springer
— ”Extended Clifford algebras” are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two speci...
ICC
2008
IEEE
13 years 11 months ago
2008
IEEE
—In this paper, we propose a network coding using a lattice for the two-way relay channel with two nodes communicating bidirectionally through a relay, which we call modulo-andfo...
EUROCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
The Lenstra-Lenstra-Lov´asz lattice basis reduction algorithm (LLL or L3 ) is a very popular tool in public-key cryptanalysis and in many other fields. Given an integer d-dimensi...
ISSAC
2009
Springer
13 years 11 months ago
2009
Springer
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
DAC
2008
ACM
14 years 6 months ago
2008
ACM
Scenario-based design exploits the time-varying execution behavior of applications by dynamically adapting the system on which they run. This is a particularly interesting design ...