We derive new upper bounds on the covering radius of a binary linear code as a function of its dual distance and dual-distance width . These bounds improve on the Delorme -Sole ´ -Stokes bounds , and in a certain interval for binary linear codes they are also better than Tieta ¨ va ¨ inen's bound .
On the covering radius of an unrestricted code as a function of the rate and dual distance
✍ Scribed by Simon Litsyn; Patrick Solé; René Struik
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 846 KB
- Volume
- 82
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
✦ Synopsis
We present a uniform approach towards deriving upper bounds on the covering radius of a code as a function of its dual distance structure and its cardinality. We show that the bounds obtained previously by Delsarte, Helleseth et al.. TietGiinen, resp. Solt-and Stokes follow as special cases. Moreover, we obtain an asymptotic improvement of these bounds using Chebyshe\ polynomials.
📜 SIMILAR VOLUMES
The coset graph of a nondegenerate cyclic code is orbital regular. This yields a lower bound on its average distance, a parameter which measures the average distortion of a code used in data compression. Using results of Shahrokhi and Sz&kely we generalize this bound to binary codes with a transitiv
One hundred seventy-eight subjects participated in a study to measure the degree of selective subtest decline on the WAIS-R as a function of increased error rate on the Memory-for-Designs Test. The data show that there is an initial, significant decline in the verbal knowledge component of the verba