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 条
  • [41] Asymptotic and constructive methods for covering perfect hash families and covering arrays
    Charles J. Colbourn
    Erin Lanus
    Kaushik Sarkar
    Designs, Codes and Cryptography, 2018, 86 : 907 - 937
  • [42] Asymptotic and constructive methods for covering perfect hash families and covering arrays
    Colbourn, Charles J.
    Lanus, Erin
    Sarkar, Kaushik
    DESIGNS CODES AND CRYPTOGRAPHY, 2018, 86 (04) : 907 - 937
  • [43] NEW BOUNDS FOR COVERING CODES OF RADIUS 3 AND CODIMENSION 3t+1
    Davydov, Alexander a.
    Marcugini, Stefano
    Pambianco, Fernanda
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2023,
  • [44] NEW BOUNDS FOR COVERING CODES OF RADIUS 3 AND CODIMENSION 3t+1
    Davydov, Alexander A.
    Marcugini, Stefano
    Pambianco, Fernanda
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2025, 19 (01) : 126 - 139
  • [45] Constructing Covering Codes with Given Automorphisms
    Patric R. J. Osterg
    William D. Weakley
    Designs, Codes and Cryptography, 1999, 16 (1) : 65 - 73
  • [46] Constructing covering codes with given automorphisms
    Östergård, PRJ
    Weakley, WDU
    DESIGNS CODES AND CRYPTOGRAPHY, 1999, 16 (01) : 65 - 73
  • [47] Linear codes with covering radius 3
    Davydov, Alexander A.
    Ostergard, Patric R. J.
    DESIGNS CODES AND CRYPTOGRAPHY, 2010, 54 (03) : 253 - 271
  • [48] Mixed covering arrays of strength three with few factors
    Colbourn, Charles J.
    Shi, Ce
    Wang, Chengmin
    Yan, Jie
    JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 2011, 141 (11) : 3640 - 3647
  • [49] Tabu search for covering arrays using permutation vectors
    Walker, Robert A., II
    Colbourn, Charles J.
    JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 2009, 139 (01) : 69 - 80
  • [50] Covering Arrays Generation Methods Survey
    Kuliamin, Victor
    Petukhov, Alexander
    LEVERAGING APPLICATIONS OF FORMAL METHODS, VERIFICATION, AND VALIDATION, PT II, 2010, 6416 : 382 - 396
12345