On the reduction of a random basis

DOI10.1051/ps:2008012zbMath1185.15030OpenAlexW2107875484MaRDI QIDQ5851031

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

Publication date: 21 January 2010

Published in: ESAIM: Probability and Statistics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104433

zbMATH Keywords

random matricesGram-Schmidt orthogonalizationbeta distributionlattice reductionrandom basisorthogonality index

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Random matrices (algebraic aspects) (15B52) Vector spaces, linear dependence, rank, lineability (15A03) Orthogonalization in numerical linear algebra (65F25) Limit theorems for vector-valued random variables (infinite-dimensional case) (60B12) Lattices (06B99)

Related Items (2)

Probabilistic analyses of the plain multiple gcd algorithm ⋮ On the reduction of a random basis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of the LLL-algorithm over Euclidean rings or orders
• Integer programming and cryptography
• Isotropy and sphericity: Some characterisations of the normal distribution
• Factoring polynomials with rational coefficients
• An upper bound on the average number of iterations of the LLL algorithm
• Random lattices, threshold phenomena and efficient reduction algorithms.
• How Tight is Hadamard's Bound?
• How Good is Hadamard’s Inequality for Determinants?
• Random matrix theory
• Minkowski Reduction of Integral Matrices
• Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection
• Exercises in Probability
• On the reduction of a random basis

This page was built for publication: On the reduction of a random basis