437 search results - page 23 / 88 » Randomized Lattice Decoding |
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...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract--Recently, it has been shown that a quantize-mapand-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitr...
125
click to vote
MMSEC
2006
ACM
15 years 5 months ago
2006
ACM
This paper presents a theoretical security analysis of lattice data hiding. The security depends on the secrecy of a dither signal that randomizes the codebook. If the same secret...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
—The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown group of sensors have been reprogrammed by a m...