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 条

[31] On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes
Laihonen T.
Litsyn S.
Designs, Codes and Cryptography, 1998, 14 (1) : 71 - 80
[32] Some Upper Bounds on the Covering Radii of Linear Codes Over Fq and Their Applications
H. Janwa
H. F. Mattson
Designs, Codes and Cryptography, 1999, 18 : 163 - 181
[33] Some upper bounds on the covering radii of linear codes over Fq and their applications
Janwa, H
Mattson, HF
DESIGNS CODES AND CRYPTOGRAPHY, 1999, 18 (1-3) : 163 - 181
[34] 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
[35] IMPROVED SPHERE BOUNDS ON THE COVERING RADIUS OF CODES
VANWEE, GJM
IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (02) : 237 - 245
[36] Bounds on the sizes of constant weight covering codes
Etzion, Tuvi
Wei, Victor
Zhang, Zhen
Designs, Codes, and Cryptography, 1995, 5 (03)
[37] NEW LOWER BOUNDS FOR BINARY COVERING CODES
LI, DF
CHEN, W
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (04) : 1122 - 1129
[38] Bounds for Covering Codes over Large Alphabets
Gerzson Kéri
Patric R. J. Östergård
Designs, Codes and Cryptography, 2005, 37 : 45 - 60
[39] Bounds for covering codes over large alphabets
Kéri, G
Östergård, PRJ
DESIGNS CODES AND CRYPTOGRAPHY, 2005, 37 (01) : 45 - 60
[40] BOUNDS ON COVERING RADIUS OF DUAL PRODUCT CODES
KATSMAN, GL
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 573 : 52 - 57

← 1 2 3 4 5 →