Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

36

CORR
2006
Springer

favoriteEmaildiscussreport

102views Education» more CORR 2006»

On the reduction of a random basis

13 years 11 months ago

On the reduction of a random basis

Download www.labri.fr

For p n, let b (n) 1 , . . . , b (n) p be independent random vectors in Rn with the same distribution invariant by rotation and without mass at the origin. Almost surely these vectors form a basis for the Euclidean lattice they generate. The topic of this paper is the property of reduction of this random basis in the sense of Lenstra-Lenstra-Lov

Ali Akhavi, Jean-François Marckert, Alain R

Real-time Traffic

Almost Surely | CORR 2006 | Education | Euclidean Lattice | Independent Random |

claim paper

Related Content

» Lattice Basis Reduction Improved Practical Algorithms and Solving Subset Sum Problems

» Fusion frames and robust dimension reduction

» Basis Reduction and the Complexity of BranchandBound

» A Mathematical Foundation for Improved Reduct Generation in Information Systems

» Practical Lattice Basis Sampling Reduction

» Design of MultiParameter Steerable Functions Using Cascade Basis Reduction

» Parallel Lattice Basis Reduction Using a Multithreaded SchnorrEuchner LLL Algorithm

» Parallel Lattice Basis Reduction

» Lattice Basis Reduction with Dynamic Approximation

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CORR
Authors	Ali Akhavi, Jean-François Marckert, Alain Rouault

Comments (0)