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 lower bounds for covering codes
Habsieger, L
Plagne, A
DISCRETE MATHEMATICS, 2000, 222 (1-3) : 125 - 149
[4] BOUNDS ON ORDERED CODES AND ORTHOGONAL ARRAYS
Barg, Alexander
Purkayastha, Punarbasu
MOSCOW MATHEMATICAL JOURNAL, 2009, 9 (02) : 211 - 243
[5] NEW LOWER BOUNDS FOR BINARY COVERING CODES
LI, DF
CHEN, W
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (04) : 1122 - 1129
[6] Bounds for Covering Codes over Large Alphabets
Gerzson Kéri
Patric R. J. Östergård
Designs, Codes and Cryptography, 2005, 37 : 45 - 60
[7] Bounds for covering codes over large alphabets
Kéri, G
Östergård, PRJ
DESIGNS CODES AND CRYPTOGRAPHY, 2005, 37 (01) : 45 - 60
[8] Structures and lower bounds for binary covering arrays
Choi, Soohak
Kim, Hyun Kwang
Oh, Dong Yeol
DISCRETE MATHEMATICS, 2012, 312 (19) : 2958 - 2968
[9] 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
[10] A note on bounds for q-ary covering codes
Bhandari, MC
Durairajan, C
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (05) : 1640 - 1642

← 1 2 3 4 5 →