Existence of super-simple OA_ (3,5,v)'s

DOI10.1007/S10623-012-9771-6zbMATH Open1292.05063OpenAlexW2018171003MaRDI QIDQ2248648FDOQ2248648

Authors: Ce Shi, Jianxing Yin 

Publication date: 27 June 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-012-9771-6

Recommendations

• The equivalence between optimal detecting arrays and super-simple OAs
• Existence of simple \(\mathrm{OA}_\lambda(3, 5, v)'\)s
• Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\)
• scientific article; zbMATH DE number 5074
• scientific article; zbMATH DE number 933193

zbMATH Keywords

detecting arrayssuper-simpleorthogonal arrays

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Detecting arrays and their optimality
• Locating and detecting arrays for interaction faults
• The CRC handbook of combinatorial designs
• Title not available (Why is that?)
• Compound Orthogonal Arrays
• A Generalization of a Theorem due to MacNeish
• Orthogonal Arrays of Index Unity
• The equivalence between optimal detecting arrays and super-simple OAs
• Constructions of new orthogonal arrays and covering arrays of strength three
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Optimum detecting arrays for independent interaction faults
• Existence of simple \(\mathrm{OA}_\lambda(3, 5, v)'\)s
• Consecutive detecting arrays for interaction faults
• Arrays for combinatorial interaction testing: a review on constructive approaches
• Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\)

This page was built for publication: Existence of super-simple \(\mathrm{OA}_\lambda (3,5,v)\)'s

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248648)