On the covering radius of a code and its subcodes
β Scribed by Richard A. Brualdi; Vera S. Pless
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 573 KB
- Volume
- 83
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We present lower and upper bounds on the covering radius of Reed-Muller codes, yielding asymptotical improvements on known results. The lower bound is simply the sphere covering one (not very new). The upper bound is derived from a thorough use of a lemma, the 'essence of Reed-Mullerity'. The idea
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 .
Classical Goppa codes are a special case of Alternant codes. First we prove that the parity-check subcodes of Goppa codes and the extended Goppa codes are both Alternant codes. Before this paper, all known cyclic Goppa codes were some particular BCH codes. Many families of Goppa codes with a cyclic
CCD photometry of Jupiter's satellite Callisto in eclipse has been fitted to model light curves to determine polar radii of 67,168 Β± 50 km (north) and 67,106 Β± 62 km (south). These values are about 172 and 110 km, respectively, greater than that computed from Jupiter's equatorial dimension and its h