Lower bounds for quaternary covering codes

被引：0
|
作者：
Haas, Wolfgang [1 ]
机构：
[1] Univ Freiburg, Math Inst, D-79104 Freiburg, Germany
来源：
ARS COMBINATORIA | 2011年 / 99卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let K(q)(n, R) denote the least cardinality of a q-ary code of length n, such that every q-ary word of length n differs from at least one word in the code in at most R places. We use a method of Blass and Litsyn to derive the bounds K(4)(5, 2) >= 14 and K(4)(6, 2) >= 32.
引用
下载
收藏
页码：19 / 23
页数：5
相关论文
共 50 条
  • [41] Lower bounds on crosscorrelation of codes
    Levenshtein, V
    IEEE ISSSTA '96 - IEEE FOURTH INTERNATIONAL SYMPOSIUM ON SPREAD SPECTRUM TECHNIQUES & APPLICATIONS, PROCEEDINGS, VOLS 1-3, 1996, : 657 - 661
  • [42] On Covering Codes and Upper Bounds for the Dimension of Simple Games
    Olsen, Martin
    THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 629 - 634
  • [43] New Bounds for Linear Codes of Covering Radius 2
    Bartoli, Daniele
    Davydov, Alexander A.
    Giulietti, Massimo
    Marcugini, Stefano
    Pambianco, Fernanda
    CODING THEORY AND APPLICATIONS, ICMCTA 2017, 2017, 10495 : 1 - 10
  • [44] Bounds for short covering codes and reactive tabu search
    Mendes, Carlos
    Monte Carmelo, Emerson L.
    Poggi, Marcus
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (05) : 522 - 533
  • [45] A note on bounds for q-ary covering codes
    Bhandari, MC
    Durairajan, C
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (05) : 1640 - 1642
  • [46] Linear Programming Bounds for Codes via a Covering Argument
    Michael Navon
    Alex Samorodnitsky
    Discrete & Computational Geometry, 2009, 41
  • [47] New quaternary linear codes with covering radius 2
    Davydov, AA
    Östergård, PRJ
    FINITE FIELDS AND THEIR APPLICATIONS, 2000, 6 (02) : 164 - 174
  • [48] Linear Programming Bounds for Codes via a Covering Argument
    Navon, Michael
    Samorodnitsky, Alex
    DISCRETE & COMPUTATIONAL GEOMETRY, 2009, 41 (02) : 199 - 207
  • [49] ASYMPTOTIC BOUNDS ON THE COVERING RADIUS OF BINARY-CODES
    SOLE, P
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (06) : 1470 - 1472
  • [50] ON THE COVERING RADIUS PROBLEM FOR CODES .1. BOUNDS ON NORMALIZED COVERING RADIUS
    KILBY, KE
    SLOANE, NJA
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1987, 8 (04): : 604 - 618
12345