A new upper bound for binary codes with minimum distance four

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 145
  • Download : 0
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
URI
http://hdl.handle.net/10203/69083
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0