𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper bounds on the cardinality of a binary code with a given minimum distance

✍ Scribed by V.M. Sidelnikov

Book ID
114037157
Publisher
Elsevier Science
Year
1975
Weight
480 KB
Volume
28
Category
Article
ISSN
0019-9958

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new upper bound for binary codes with
A new upper bound for binary codes with minimum distance four
✍ Jun Kyo Kim; Sang Geun Hahn πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 134 KB

The purpose of this paper is to give an upper bound for A [n,4], the maximum number of codewords in a binary code of length n with minimum distance d between codewords.

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 .