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)

    Why does the past look so enticing to us? For the same reason why from a distance a meadow with flowers looks like a flower bed.
    Franz Grillparzer (1791–1872)