New upper bound for binary codes with minimum distance four

被引:0
|
作者
Kim, JK [1 ]
Hahn, SG [1 ]
机构
[1] Korea Adv Inst Sci & Technol, Dept Math, Taejon 305701, South Korea
关键词
one-error-correcting codes; binary codes;
D O I
10.1016/S0012-365X(97)00199-4
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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. (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:291 / 295
页数:5
相关论文
共 50 条