Nearest lattice point algorithms on semi k-reduced basis
Date
2003
Authors
Shen, H.
Kan, H.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Science China Information Sciences, 2003; 46(6):485-494
Statement of Responsibility
Conference Name
Abstract
In this paper, we firstly generalize the relations among the basis vectors of LLL reduced basis to semi k-reduced basis. Then we analyze the complexities of the nearest plane algorithm and round-off algorithm on semi k-reduced basis, which, compared with L. Babai’s results on LLL reduced basis, have better approximate ratios and contain almost the same time complexities.