I am having difficulty understanding this particular definition of Covering Radius Problem - "Given a basis for the lattice, the algorithm must find the largest distance (or in some versions, its approximation) from any vector to the lattice".

Can anyone please explain what is the meaning of "largest distance from any vector to the lattice". How is distance of a vector calculated from a lattice rather than another vector?


If you have a subset $A\subseteq \mathbb R^n$ and a point $x\in \mathbb R^n$ you can define $d(x,A)$ as $\inf\{d(x,a) | a\in A\}$.

Since lattices are closed sets we can consider $\min\{d(x,a)|a\in A\}$

  • $\begingroup$ Can you please explain how is a lattice, a closed set. Does it mean a finite fixed dimension or closure to some operation? $\endgroup$ – Mayank Sep 23 '16 at 20:18
  • $\begingroup$ How do you define lattices as closed sets? $\endgroup$ – Mayank Sep 25 '16 at 13:26

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.