437 search results - page 34 / 88 » Randomized Lattice Decoding |
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We consider the ‘one-shot frame synchronization problem’ where a decoder wants to locate a sync pattern at the output of a channel on the basis of sequential observations. We ...
108
click to vote
APPROX
2007
Springer
15 years 5 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
124
click to vote
TWC
2010
14 years 6 months ago
2010
The goal of this paper is to explore the benefits of channel diversity in wireless ad hoc networks. Our model is that of a Poisson point process of transmitters, each with a recei...
TOC
2008
14 years 11 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
115
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...