13 search results - page 3 / 3 » On Bounded Distance Decoding for General Lattices |
100
Voted
MMMACNS
2001
Springer
15 years 6 months ago
2001
Springer
The main cryptographic primitives (Bit Commitment (BC) and Oblivious Transfer (OT) protocols) based on noisy channels have been considered in [1] for asymptotic case. Non-asymptoti...
110
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
112
Voted
SIAMCOMP
2010
15 years 4 days ago
2010
We propose a general model of local property reconstruction. Suppose we have a function f on domain Γ, which is supposed to have a particular property P, but may not have the pro...