Paper Info
Title
Upper Bounds And Constructions Of Locating Arrays
Abstract
The use of locating arrays is motivated by the use of generating software test suites to locate interaction faults in component-based systems. In this paper, we introduce a new combinatorial configuration, with which a general combinatorial description of ((1) over bar, t)-locating arrays is presented. Based on this characterization, a number of locating arrays by means of SSOA and difference covering arrays with prescribed properties are constructed effectively. As a consequence, upper bounds on the size of locating arrays with small number of factors are then obtained.
Year
DOI
Venue
2021
10.1587/transfun.2020EAL2081
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
Keywords
DocType
Volume
locating arrays, upper bound, extendible, covering arrays, construction
Journal
E104A
Issue
ISSN
Citations 
5
0916-8508
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Ce Shi101.35
Jianfeng Fu200.34
Chengmin Wang3448.30
Jie Yan4283.42