𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Codes with given distances

✍ Scribed by H. Enomoto; P. Frankl; N. Ito; K. Nomura

Book ID
105309427
Publisher
Springer Japan
Year
1987
Tongue
English
Weight
784 KB
Volume
3
Category
Article
ISSN
0911-0119

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 .

An extremum problem for polynomials and
An extremum problem for polynomials and bounds for codes with given distance and diameter
✍ G. Fazekas πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 442 KB

this paper, proving first a Lloyd-type theorem we solve an extremum problem for systems of orthogonal polynomials and show how this result can be applied to the estimation of the cardinality of codes with given minimal distance and diameter in polynomial metric spaces. A similar approach has been es

Dual distances of completely regular cod
Dual distances of completely regular codes
✍ B. Courteau; A. Montpetit πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 467 KB

Courteau, B. and A. Montpetit, Dual distances of completely regular codes, Discrete Mathematics 89 (1991) 7-15. In this paper we prove two theorems giving arithmetical constraints on the possible values of dual distances of completely regular codes extending some recent results of Calderbank and Gce