4 search results - page 1 / 1 » Improved Delsarte bounds for spherical codes in small dimens... |
JCT
2007
13 years 4 months ago
2007
ABSTRACT. We present an extension of the Delsarte linear programming method for spherical codes. For several dimensions it yields improved upper bounds including some new bounds on...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
EUROCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...