Back to Results
First PageMeta Content
Computational number theory / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Matrices / QR decomposition / Orthogonal matrix / Algebra / Mathematics / Numerical linear algebra


Partial LLL Reduction Xiaohu Xie Xiao-Wen Chang Mazen Al Borno
Add to Reading List

Document Date: 2011-08-29 23:51:55


Open Document

File Size: 228,59 KB

Share Result on Facebook

City

Amsterdam / Baltimore / /

Company

Johns Hopkins University Press / HP / /

Country

Netherlands / /

Currency

ILS / /

/

Facility

Mathematisch Institute / Computer Science University of Toronto Toronto / Computer Science McGill University / /

IndustryTerm

reduction algorithm / search process / real-time requirement / search trees / produced approximate integer solution / reduction algorithms / depth-first search / approximate solution / search process stops / digital communications / Wireless Communications / point search / nearest plane algorithm / search speed / suboptimal solution / search phase / /

OperatingSystem

Linux / /

Organization

The Johns Hopkins University / School of Computer Science McGill University Montreal / Mathematisch Institute / Computer Science University of Toronto Toronto / Partial LLL Reduction Xiaohu Xie Xiao-Wen Chang Mazen Al Borno School of Computer Science McGill University Montreal / /

Person

Xiao-Wen Chang Mazen Al / /

ProvinceOrState

Maryland / /

PublishedMedium

IEEE Transactions on Information Theory / Mathematische Annalen / /

Technology

three reduction algorithms / Linux / partial LLL reduction algorithm / LLL algorithm / typical SD algorithm / SD algorithm / ELLL algorithm / nearest plane algorithm / D. PLLL reduction algorithm / Schnorr-Euchner algorithm / reduction algorithm / two algorithms / following inequality Algorithm / /

SocialTag