Lattice Problem - Bounded Distance Decoding

Bounded Distance Decoding

This problem is similar to CVP. Given a vector such that its distance from the lattice is at most, the algorithm must output the closest lattice vector to it.

Read more about this topic:  Lattice Problem

Famous quotes containing the words bounded and/or distance:

    I could be bounded in a nutshell and count myself a king of
    infinite space, were it not that I have bad dreams.
    William Shakespeare (1564–1616)

    The mystery of the evening-star brilliant in silence and distance between the downward-surging plunge of the sun and the vast, hollow seething of inpouring night. The magnificence of the watchful morning-star, that watches between the night and the day, the gleaming clue to the two opposites.
    —D.H. (David Herbert)