8 edited tags
7 deleted 107 characters in body

http://en.wikipedia.org/wiki/Lenstra%E2%80%93Lenstra%E2%80%93Lov%C3%A1sz_lattice_basis_reduction_algorithm

What is the importance of the $\delta$ parameter for LLL bases called Lovász condition?

Wiki seems to mention that the higher the $\delta$ the better.

What does it mean when $\delta = 1$? Can we finding find shortest vector and closest vector easily if $\delta =1$? What are typical error in approximations when $\delta = 1$?

In the SVP and CVP algorithm presented below, is there any connection to $\delta$ on the approximation error(wiki seems to mention that the higher the $\delta$ the better).

http://www.cs.tau.ac.il/~odedr/teaching/lattices_fall_2004/ln/cvp.pdf

Can $\delta \ge 1$ be satisfied and is there a consequence on the bases and estimate of minimum distance between lattice points and CVP distance estimates if this is so?

Finally is there a reference that talks about connections to CVP and minimum distance?

6 added 113 characters in body

http://en.wikipedia.org/wiki/Lenstra%E2%80%93Lenstra%E2%80%93Lov%C3%A1sz_lattice_basis_reduction_algorithm

What is the importance of the $\delta$ parameter for LLL bases called Lovász condition?

What does it mean when $\delta = 1$? Can we finding shortest vector and closest vector easily if $\delta =1$?

In the CVP algorithm presented below, is there any connection to $\delta$ on the approximation error (wiki seems to mention that the higher the $\delta$ the better).

http://www.cs.tau.ac.il/~odedr/teaching/lattices_fall_2004/ln/cvp.pdf

Can $\delta \ge 1$ be satisfied and is there a consequence on the bases and estimate of minimum distance between lattice points and CVP distance estimates if this is so?

Finally is there a reference that talks about connections to CVP and minimum distance?

5 edited body; added 2 characters in body
4 added 3 characters in body; edited tags
3 added 227 characters in body
2 added 2 characters in body; edited title
1