论文标题
定位具有混合字母大小的阵列
Locating arrays with mixed alphabet sizes
论文作者
论文摘要
定位阵列（LAS）可用于检测和识别基于组件的系统中因子之间的相互作用故障。在所有因素都具有相同值的假设下，已经对具有单个断层的LA的最优性和构造进行了广泛的研究。但是，在现实生活中，系统中的不同因素具有不同数量的可能值。因此，LAS必须满足此类要求。我们在这里建立了一个一般下限，对混合级别$（\ bar {1}，t）$的大小 - 定位数组。提供了一些用于构建LA的方法，包括直接和递归结构。特别是，描述了产生满足下限的最佳LA的结构。此外，还提供了一些满足下限的最佳LA。
Locating arrays (LAs) can be used to detect and identify interaction faults among factors in a component-based system. The optimality and constructions of LAs with a single fault have been investigated extensively under the assumption that all the factors have the same values. However, in real life, different factors in a system have different numbers of possible values. Thus, it is necessary for LAs to satisfy such requirements. We herein establish a general lower bound on the size of mixed-level $(\bar{1},t)$-locating arrays. Some methods for constructing LAs including direct and recursive constructions are provided. In particular, constructions that produce optimal LAs satisfying the lower bound are described. Additionally, some series of optimal LAs satisfying the lower bound are presented.
