𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New Bounds On Covering Radius as a Function of Dual Distance

✍ Scribed by Laihonen, Tero; Litsyn, Simon

Book ID
118198135
Publisher
Society for Industrial and Applied Mathematics
Year
1999
Tongue
English
Weight
281 KB
Volume
12
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 .

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