151 search results - page 8 / 31 » A Lower Bound on List Size for List Decoding |
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— Lattice basis reduction is a powerful technique that enables a hard-output detector for a multiple-input multiple-output channel to approach maximum-likelihood performance with...
CORR
1998
Springer
13 years 7 months ago
1998
Springer
We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In par...
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...