LOWER BOUNDS FOR q-ARY COVERING CODES

被引：0
|
作者：
陈文德
IIRO S. HONKALA
机构：
[1] Academia Sinica
[2] 20500 Turku 50
[3] University of Turku
[4] Department of Mathematics
[5] Inslitute of Systems Science
[6] Beijing 100080
[7] Finland
[8] PRC
来源：
Science Bulletin | 1990年 / 06期
关键词：
Zn; LOWER BOUNDS FOR q-ARY COVERING CODES;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Define K(n,R)as the minimum cardinality of any q-ary code of length n and covering radius R, q∈N, q≥3, and
引用
收藏
页码：521 / 522
页数：2
相关论文
共 50 条
  • [1] LOWER BOUNDS FOR Q-ARY COVERING CODES
    CHEN, W
    HONKALA, IS
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (03) : 664 - 671
  • [2] LOWER BOUNDS FOR Q-ARY COVERING CODES
    CHEN, WD
    HONKALA, IS
    CHINESE SCIENCE BULLETIN, 1990, 35 (06): : 521 - 522
  • [3] Lower bounds for q-ary codes of covering radius one
    Haas, W
    DISCRETE MATHEMATICS, 2000, 219 (1-3) : 97 - 106
  • [4] Lower Bounds for q-ary Codes with Large Covering Radius
    Haas, Wolfgang
    Halupczok, Immanuel
    Schlage-Puchta, Jan-Christoph
    ELECTRONIC JOURNAL OF COMBINATORICS, 2009, 16 (01):
  • [5] A note on bounds for q-ary covering codes
    Bhandari, MC
    Durairajan, C
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (05) : 1640 - 1642
  • [6] UPPER-BOUNDS FOR Q-ARY COVERING CODES
    OSTERGARD, PRJ
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (03) : 660 - 664
  • [7] ON (Q,1)-SUBNORMAL Q-ARY COVERING CODES
    HONKALA, I
    DISCRETE APPLIED MATHEMATICS, 1994, 52 (03) : 213 - 221
  • [8] New constructions for q-ary covering codes
    Östergård, PRJ
    ARS COMBINATORIA, 1999, 52 : 51 - 63
  • [9] New lower bounds on q-ary error-correcting codes
    Laaksonen, Antti
    Ostergard, Patric R. J.
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2019, 11 (05): : 881 - 889
  • [10] New lower bounds on q-ary error-correcting codes
    Antti Laaksonen
    Patric R. J. Östergård
    Cryptography and Communications, 2019, 11 : 881 - 889
12345