A new upper bound for binary codes with minimum distance four
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. ？ 1998 Elsevier Science B.V. All rights reserved.
- Publisher
- Elsevier BV
- Issue Date
- 1998-06
- Language
- English
- Citation
DISCRETE MATHEMATICS, v.187, no.1-3, pp.291 - 295
- ISSN
- 0012-365X
- Appears in Collection
- MA-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.