𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Covering radius and dual distance

✍ Scribed by A. Tietäväinen

Book ID
104631078
Publisher
Springer
Year
1991
Tongue
English
Weight
502 KB
Volume
1
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

✦ Synopsis

Recently a number of bounds have been obtaiaed for the covering radius of a code with given length and cardinality. Iu this paper we show that--perhaps surprisingly--the covering radius of a code depends heavily on its dual distance. We consider an arbitrary fimte Abelian group alphabet though in the applications the alphabet is very often the field F~.

📜 SIMILAR VOLUMES

On the covering radius of an unrestricte
On the covering radius of an unrestricted code as a function of the rate and dual distance
✍ Simon Litsyn; Patrick Solé; René Struik 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 846 KB

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. Moreove

Upper Bounds on the Covering Radius of a
Upper Bounds on the Covering Radius of a Code with a Given Dual Distance
✍ S. Litsyn; A. Tietäväinen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 235 KB

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 .