256 search results - page 5 / 52 » Recursive Lattice Reduction |
TIT
1998
13 years 7 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...
IACR
2011
12 years 7 months ago
2011
Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic schemes related to L. The...
ISCAS
2005
IEEE
14 years 1 months ago
2005
IEEE
— A principle of linear mean-square estimation which we call the “missing observations theorem” is presented here and used to provide a simple alternative derivation of Levin...
ANTS
2006
Springer
13 years 11 months ago
2006
Springer
We propose a practical sampling reduction algorithm for lattice bases based on work by Schnorr [1] as well as two even more effective generalizations. We report the empirical behav...
JSYML
2007
13 years 7 months ago
2007
Substructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0, 1]. In this paper, we introduce Un...