274 search results - page 12 / 55 » Counting lattice vectors |
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
In this work we present an efficient coding scheme suitable for lossy image compression using a lattice vector quantizer (LVQ) based on statistically independent data projections...
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
—In this paper, a lattice-reduction-aided (LRA) With such an approximation, the complexity of VP is greatly minimum mean square error (MMSE) vector precoding (VP) is reduced. pro...
104
click to vote
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
FOCS
1998
IEEE
15 years 4 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
DCC
2006
IEEE
15 years 11 months ago
2006
IEEE
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...