An improved LLL algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Factoring polynomials with rational coefficients
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- On the sphere-decoding algorithm I. Expected complexity
Cited in
(19)- Matrices and the LLL algorithm
- A pivoted LLL algorithm
- An Efficient LLL Gram Using Buffered Transformations
- A modification of the LLL reduction algorithm
- On LLL lattice basis reduction over imaginary quadratic fields by introducing reduction parameters
- The history of the LLL-algorithm
- Loop-reduction LLL algorithm and architecture for lattice-reduction-aided MIMO detection
- Effect of the interval-symbol method with correct zero rewriting on the \(\delta\)-LLL algorithm
- A comparative study of the LLL algorithm
- Parallel Cholesky-based reduction for the weighted integer least squares problem
- A modified LLL algorithm for GPS integer ambiguity decorrelation
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
- Recovering exact results from inexact numerical data in algebraic geometry
- A new method for lattice reduction using directional and hyperplanar shearing
- An Improvement of the Elliptic Net Algorithm
- Solving ellipsoid-constrained integer least squares problems
- Efficient lattice reduction updating and downdating methods and analysis
- An efficient algorithm for clustered integer least squares problems.
- Boosted KZ and LLL Algorithms
This page was built for publication: An improved LLL algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465313)