Consecutive Detecting Arrays from m-Sequences

被引：0
|
作者：
Shi, Ce [1 ]
Tao, Aiyuan [2 ]
机构：
[1] School of Statistics and Mathematics, Shanghai Lixin University of Accounting and Finance, Shanghai,201209, China
[2] School of International Economics and Trade, Shanghai Lixin University of Accounting and Finance, Shanghai,201209, China
来源：
IAENG International Journal of Applied Mathematics | 2020年 / 50卷 / 01期
基金：
上海市自然科学基金; 中国国家自然科学基金;
关键词：
Binary sequences;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Linear feedback shift register (LFSR) sequences are sequences of elements of a finite field that satisfy some linear recurrence relations. LFSR sequences that attain maximum possible periods are called maximal (period) sequences, often abbreviated as m-sequences. Arrays constructed from cyclic shifts of m-sequences possess rich combinatorial properties and have previously been used in the construction of (ordered) orthogonal and covering arrays. We propose the notion of consecutive detecting arrays for generating test suites for locating and detecting interaction faults between neighboring factors in combinatorial interaction testing. In this paper, we explain the construction of a class of consecutive detecting arrays from m- sequences and illustrate their use through concrete examples. Furthermore, we show some consecutive detecting arrays with minimum size for practical use. © 2020.
引用
收藏
页码：80 / 86
相关论文
共 50 条
12345