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 条
  • [31] EXPLICIT CODES WITH LOW COVERING RADIUS
    PACH, J
    SPENCER, J
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) : 1281 - 1285
  • [32] ON THE COVERING RADIUS OF SOME MODULAR CODES
    Gupta, Manish K.
    Durairajan, Chinnappillai
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2014, 8 (02) : 129 - 137
  • [33] Linear codes with covering radius 3
    Davydov, Alexander A.
    Ostergard, Patric R. J.
    DESIGNS CODES AND CRYPTOGRAPHY, 2010, 54 (03) : 253 - 271
  • [34] A note on covering radius of MacDonald codes
    Bhandari, MC
    Durairajan, C
    ITCC 2003: INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: COMPUTERS AND COMMUNICATIONS, PROCEEDINGS, 2003, : 221 - 225
  • [35] SHORT CODES WITH A GIVEN COVERING RADIUS
    BRUALDI, RA
    PLESS, VS
    WILSON, RM
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (01) : 99 - 109
  • [36] More on the covering radius of BCH codes
    LevyditVehel, F
    Litsyn, S
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (03) : 1023 - 1028
  • [37] A NEW APPROACH TO THE COVERING RADIUS OF CODES
    SLOANE, NJA
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 1986, 42 (01) : 61 - 86
  • [38] On the covering radius of long goppa codes
    LevyditVehel, F
    Litsyn, S
    APPLIED ALGEBRA, ALGEBRAIC ALGORITHMS AND ERROR-CORRECTING CODES, 1995, 948 : 341 - 346
  • [39] BOUNDS ON COVERING RADIUS OF LINEAR CODES
    VELIKOVA, E
    DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1988, 41 (06): : 13 - 16
  • [40] Bounds on the Covering Radius of Linear Codes
    A. Ashikhmin
    A. Barg
    Designs, Codes and Cryptography, 2002, 27 : 261 - 269
12345