๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Binary codes with a minimum distance of four (Corresp.)

โœ Scribed by Best, M.

Book ID
114635005
Publisher
IEEE
Year
1980
Tongue
English
Weight
660 KB
Volume
26
Category
Article
ISSN
0018-9448

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.