✦ LIBER ✦

Packing radius, covering radius, and dual distance

✍ Scribed by Sole, P.

Book ID: 114540135
Publisher: IEEE
Year: 1995
Tongue: English
Weight: 541 KB
Volume: 41
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.370102

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Covering radius and dual distance

✍ A. Tietäväinen 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 502 KB

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 th

Covering radius, codimension, and dual-d

Covering radius, codimension, and dual-distance width

✍ Sole, P.; Stokes, P. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 643 KB

On relations between covering radius and

On relations between covering radius and dual distance

✍ Ashikhmin, A.E.; Honkala, I.S.; Laibonen, T.K.; Litsyn, S.N. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 286 KB

New Bounds On Covering Radius as a Funct

New Bounds On Covering Radius as a Function of Dual Distance

✍ Laihonen, Tero; Litsyn, Simon 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 281 KB

An upper bound on the covering radius as

An upper bound on the covering radius as a function of the dual distance

✍ Tietavainen, A.A. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 288 KB

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 .