Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/36762
Type: Journal article
Title: Nearest lattice point algorithms on semi k-reduced basis
Author: Shen, H.
Kan, H.
Citation: Science in China. Series F: Information Sciences, 2003; 46(6):485-494
Publisher: Zhongguo Kexue Zazhishe
Issue Date: 2003
ISSN: 1009-2757
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.
Keywords: lattice; reduced basis; nearest plane; algorithm.
RMID: 0020065631
Appears in Collections:Computer Science publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.