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 条

[1] On mixed codes with covering radius 1 and minimum distance 2
Haas, Wolfgang
Quistorff, Jorn
ELECTRONIC JOURNAL OF COMBINATORICS, 2007, 14 (01):
[2] New results on codes with covering radius 1 and minimum distance 2
Östergård, PRJ
Quistorff, J
Wassermann, A
DESIGNS CODES AND CRYPTOGRAPHY, 2005, 35 (02) : 241 - 250
[3] Graphs associated with codes of covering radius 1 and minimum distance 2
Hall, Joanne L.
ELECTRONIC JOURNAL OF COMBINATORICS, 2008, 15 (01):
[4] New Results on Codes with Covering Radius 1 and Minimum Distance 2
Patric R. J. Östergård
Jörn Quistorff
Alfred Wassermann
Designs, Codes and Cryptography, 2005, 35 : 241 - 250
[5] On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes
Laihonen T.
Litsyn S.
Designs, Codes and Cryptography, 1998, 14 (1) : 71 - 80
[6] On upper bounds for minimum distance and covering radius of non-binary codes
Laihonen, Tero
Litsyn, Simon
Designs, Codes, and Cryptography, 1998, 14 (01): : 71 - 80
[7] Asymptotic minimum covering radius of block codes
Chen, PN
Han, YSS
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2001, 14 (04) : 549 - 564
[8] On the Covering Radius of Long 5-ary BCH Codes with Minimum Distance 7
Y. Kaipainen
K. Suominen
Applicable Algebra in Engineering, Communication and Computing, 1997, 8 : 403 - 410
[9] On the covering radius of long 5-ary BCH codes with minimum distance 7
Kaipainen, Y
Suominen, K
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 1997, 8 (05) : 403 - 410
[10] On the Covering Radius of Small Codes Versus Dual Distance
Bazzi, Louay
IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (01) : 174 - 183

← 1 2 3 4 5 →