On codes with covering radius 1 and minimum distance 2

被引：3
|
作者：
Blokhuis, A
Egner, S
Hollmann, HDL
van Lint, JH
机构：
[1] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
[2] Philips Res Labs, NL-5656 AA Eindhoven, Netherlands
来源：
INDAGATIONES MATHEMATICAE-NEW SERIES | 2001年 / 12卷 / 04期
关键词：
D O I：
10.1016/S0019-3577(01)80033-1
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We show that a code C of length n over an alphabet Q of size q with minimum distance 2 and covering radius 1 satisfies /C/ greater than or equal to q(n-1)/(n - 1). For the special case n = q = 4 the smallest known example has /C/ = 31. We give a construction for such a code C with /C/ = 28.
引用
收藏
页码：449 / 452
页数：4
相关论文
共 50 条
12345