Sciweavers

164 search results - page 5 / 33
» Improved upper bounds on sizes of codes
Sort
View
JCT
2007
134views more  JCT 2007»
14 years 9 months ago
Improved Delsarte bounds for spherical codes in small dimensions
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...
Florian Pfender
TIT
2008
149views more  TIT 2008»
14 years 9 months ago
An Improved Bound on the List Error Probability and List Distance Properties
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...
TIT
2008
90views more  TIT 2008»
14 years 9 months ago
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
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...
Gil Wiechman, Igal Sason
DCC
2010
IEEE
14 years 4 months ago
Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry 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...
Nathan Drake, Gretchen L. Matthews
CORR
2010
Springer
76views Education» more  CORR 2010»
14 years 9 months ago
Improved Bounds on Restricted Isometry Constants for Gaussian Matrices
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...
Bubacarr Bah, Jared Tanner