论文标题
在NRT空间中的覆盖码上的覆盖阵列和上限
Ordered Covering Arrays and Upper Bounds on Covering Codes in NRT spaces
论文作者
论文摘要
这项工作显示了使用投影，融合，柱增强，推导，串联和笛卡尔产品的几个直接和递归构造。 NRT空间中覆盖码的上限也可以通过改善一般上限来获得。我们探讨了有序覆盖阵列和覆盖NRT空间中的代码之间的连接，这些连接概括了锤式指标的相似结果。结合新的上限，以覆盖NRT空间中的代码和有序的覆盖阵列，我们改善了较大字母内NRT空间中覆盖代码的上限。我们给出表格，将覆盖代码的新上限与现有代码进行比较。
This work shows several direct and recursive constructions of ordered covering arrays using projection, fusion, column augmentation, derivation, concatenation and cartesian product. Upper bounds on covering codes in 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.
