Bipartite Locating Arrays And Bipartite Detecting Arrays

In component-based systems composed of two groups,it is a waste of talent to use locating and detecting arrays to locate all interaction faults because the interactions within the group are of little sense.So bipartite locating and detecting arrays are proposed in this paper to save time and cost of tests.When a single fault is to be located,we propose both a lower bound on the size of bipartite locating and detecting arrays,and take lower bound as a benchmark to measure the optimality.Moreover,the upper bound of number of columns of bipartite detecting arrays is obtained,when a group only has one factor.Construction method of optimal bipartite locating arrays is proposed and a large quantity of optimal bipartite locating arrays are obtained.When there is only one factor in a group,optimal bipartite detecting arrays with arbitrary level are obtained based on Latin square designs.