MATRIS Paper in Bulletin of the ICA
At the end of 2024, Irene Hiess, Ludwig Kampel and Dimitris Simos published a paper on Optimal ordered covering arrays via an exact algorithm in the Bulletin of the Institute of Combinatorics and its Application.
Abstract
Ordered covering arrays (orCAs) are combinatorial objects that recently raised interest as they can be used for the generation of covering codes in Niederreiter-Rosenbloom-Tsfasman (NRT) spaces. We present an exact algorithm for the generation of orCAs and use this algorithm to determine sizes of some optimal orCAs. With the calculated orCAs and a theorem from Castoldi et al., J. Combin. Des., 2023, we can phrase inequalities giving upper bounds on the size of covering codes in NRT spaces. We discuss these in the context of bounds that can be derived based on results existing in the literature.
Authors
Irene Hiess
Ludwig Kampel
Dimitris Simos