Sciweavers

Share
28 search results - page 1 / 6
» Bounds on the Covering Radius of Linear Codes
Sort
View
DCC
2002
IEEE
9 years 2 months ago
Bounds on the Covering Radius of Linear Codes
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribu...
Alexei E. Ashikhmin, Alexander Barg
ECCC
2007
96views more  ECCC 2007»
9 years 2 months ago
Linear programming bounds for codes via a covering argument
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Michael Navon, Alex Samorodnitsky
SIAMDM
2002
84views more  SIAMDM 2002»
9 years 2 months ago
Multicovering Bounds from Relative Covering Radii
The multicovering radii of a code are recently introduced natural generalizations of the covering radius measuring the smallest radius of balls around codewords that cover all m-t...
Iiro S. Honkala, Andrew Klapper
COMBINATORICS
2007
86views more  COMBINATORICS 2007»
9 years 2 months ago
Lower Bounds for the Football Pool Problem for 7 and 8 Matches
Let k3(n) denote the minimal cardinality of a ternary code of length n and covering radius one. In this paper we show k3(7) ≥ 156 and k3(8) ≥ 402 improving on the best previou...
Wolfgang Haas
COCO
2004
Springer
147views Algorithms» more  COCO 2004»
9 years 6 months ago
The Complexity of the Covering Radius Problem on Lattices and Codes
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
Venkatesan Guruswami, Daniele Micciancio, Oded Reg...
books