Ordered covering arrays and upper bounds on covering codes

被引：1
|
作者：
Castoldi, Andre Guerino [1 ]
Carmelo, Emerson Monte L. [2 ]
Moura, Lucia [3 ]
Panario, Daniel [4 ]
Stevens, Brett [4 ]
机构：
[1] Univ Tecnol Fed Parana, Dept Matemat, Pato Branco, PR, Brazil
[2] Univ Estadual Maringa, Dept Matemat, Maringa, PR, Brazil
[3] Univ Ottawa, Sch Elect Engn & Comp Sci, Ottawa, ON, Canada
[4] Carleton Univ, Sch Math & Stat, Ottawa, ON, Canada
来源：
JOURNAL OF COMBINATORIAL DESIGNS | 2023年 / 31卷 / 06期
基金：
加拿大自然科学与工程研究理事会;
关键词：
bounds on codes; covering array; covering code; Niederreiter-Rosenbloom-Tsfasman metric; ordered covering array; ordered orthogonal array; CONSTRUCTIONS; (T; M; S)-NETS;
D O I：
10.1002/jcd.21882
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
This work shows several direct and recursive constructions of ordered covering arrays (OCAs) using projection, fusion, column augmentation, derivation, concatenation, and Cartesian product. Upper bounds on covering codes in Niederreiter-Rosenbloom-Tsfasman (shorten by NRT) spaces are also obtained by improving a general upper bound. We explore the connection between ordered covering arrays and covering codes in NRT spaces, which generalize similar results for the Hamming metric. Combining the new upper bounds for covering codes in NRT spaces and ordered covering arrays, we improve upper bounds on covering codes in NRT spaces for larger alphabets. We give tables comparing the new upper bounds for covering codes to existing ones.
引用
收藏
页码：304 / 329
页数：26
相关论文
共 50 条
  • [1] Bounds on Covering Codes in RT Spaces Using Ordered Covering Arrays
    Castoldi, Andre Guerino
    do Monte Carmelo, Emerson Luiz
    Moura, Lucia
    Panario, Daniel
    Stevens, Brett
    ALGEBRAIC INFORMATICS, CAI 2019, 2019, 11545 : 100 - 111
  • [2] UPPER BOUNDS ON THE SIZE OF COVERING ARRAYS
    Sarkar, Kaushik
    Colbourn, Charles J.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (02) : 1277 - 1293
  • [3] New upper bounds for binary covering codes
    Ostergard, PRJ
    Kaikkonen, MK
    DISCRETE MATHEMATICS, 1998, 178 (1-3) : 165 - 179
  • [4] Upper bounds for covering arrays by tabu search
    Nurmela, KJ
    DISCRETE APPLIED MATHEMATICS, 2004, 138 (1-2) : 143 - 152
  • [5] COVERING BOUNDS FOR CODES
    CALDERBANK, AR
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 1992, 60 (01) : 117 - 122
  • [6] On Covering Codes and Upper Bounds for the Dimension of Simple Games
    Olsen, Martin
    THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 629 - 634
  • [7] New Upper Bounds for Covering Arrays of Order Seven
    Torres-Jimenez, Jose
    Izquierdo-Marquez, Idelfonso
    MATHEMATICS, 2024, 12 (12)
  • [8] MODIFIED BOUNDS FOR COVERING CODES
    HONKALA, IS
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (02) : 351 - 365
  • [9] On lower bounds for covering codes
    Bhandari, M.C.
    Chanduka, K.K.P.
    Lal, A.K.
    Designs, Codes, and Cryptography, 1998, 15 (03): : 237 - 243
  • [10] On Lower Bounds for Covering Codes
    Bhandari M.C.
    Chanduka K.K.P.
    Lal A.K.
    Designs, Codes and Cryptography, 1998, 15 (3) : 237 - 243
12345