On the reduction of a random basis

DOI10.1051/ps:2008012zbMath1185.15030MaRDI 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 matrices; Gram-Schmidt orthogonalization; beta distribution; lattice reduction; random basis; orthogonality index

Mathematics Subject Classification ID

68W40: Analysis of algorithms

15B52: Random matrices (algebraic aspects)

15A03: Vector spaces, linear dependence, rank, lineability

65F25: Orthogonalization in numerical linear algebra

60B12: Limit theorems for vector-valued random variables (infinite-dimensional case)

06B99: Lattices

Related Items

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

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