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

共 32 条

[1]

Barg A, 2009, MOSC MATH J, V9, P211

[2] MORE COVERINGS BY ROOK DOMAINS [J].

BLOKHUIS, A ;

LAM, CWH .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1984, 36 (02) :240-244

[3] Codes with a poset metric [J].

Brualdi, RA ;

Graves, JS ;

Lawrence, KM .

DISCRETE MATHEMATICS, 1995, 147 (1-3) :57-72

[4] ON COVERING AND COLORING PROBLEMS FOR ROOK DOMAINS [J].

CARNIELLI, WA .

DISCRETE MATHEMATICS, 1985, 57 (1-2) :9-16

[5] Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space [J].

Castoldi, Andre G. ;

do Monte Carmelo, Emerson L. ;

da Silva, Robson .

COMPUTATIONAL & APPLIED MATHEMATICS, 2019, 38 (02)

[6]

Castoldi AG, 2015, ELECTRON J COMB, V22

[7] Bounds on Covering Codes in RT Spaces Using Ordered Covering Arrays [J].

Castoldi, Andre Guerino ;

do Monte Carmelo, Emerson Luiz ;

Moura, Lucia ;

Panario, Daniel ;

Stevens, Brett .

ALGEBRAIC INFORMATICS, CAI 2019, 2019, 11545 :100-111

[8] Ordered Orthogonal Array Construction Using LFSR Sequences [J].

Castoldi, Andre Guerino ;

Moura, Lucia ;

Panario, Daniel ;

Stevens, Brett .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (02) :1336-1347

[9] On the state of strength-three covering arrays [J].

Chateauneuf, M ;

Kreher, DL .

JOURNAL OF COMBINATORIAL DESIGNS, 2002, 10 (04) :217-238

[10]

Cohen G., 1997, Covering Codes

← 1 2 3 4 →