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...
A new upper bound on the list error probability is presented. This bound is derived by combining the techniques for obtaining the tangential union bound with an improved bound on t...
Irina E. Bocharova, Rolf Johannesson, Boris D. Kud...
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
The Restricted Isometry Constants (RIC) of a matrix A measures how close to an isometry is the action of A on vectors with few nonzero entries, measured in the 2 norm. Specifically...