Covering arrays and intersecting codes

Sloane, N. J. A.

doi:10.1002/jcd.3180010106

Cited by 137 publications

(99 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to the coincidence with the notion of intersecting codes, binary minimal codes have received a lot of attention [CL85,Slo93,CZ94,BCS96,EC99]. For instance, [CL85] gives definitions, some generic constructions and non-constructive bounds on rates; [Slo93] gives explicit constructions for small dimensions and summarizes bounds on minimal distance; [CZ94] gives an explicit constructive sequence of intersecting codes with high rate, and so on.…”

Section: The Binary Casementioning

confidence: 99%

Towards Secure Two-Party Computation from the Wire-Tap Channel

Chabanne

Cohen

Patey

2014

Information Security and Cryptology -- ICISC 2013

View full text Add to dashboard Cite

We introduce a new protocol for secure two-party computation of linear functions in the semi-honest model, based on coding techniques. We first establish a parallel between the second version of the wire-tap channel model and secure two-party computation. This leads us to our protocol, that combines linear coset coding and oblivious transfer techniques. Our construction requires the use of binary intersecting codes or q-ary minimal codes, which are also studied in this paper.

show abstract

Section: The Binary Casementioning

confidence: 99%

Towards Secure Two-Party Computation from the Wire-Tap Channel

Chabanne

Cohen

Patey

2014

Information Security and Cryptology -- ICISC 2013

View full text Add to dashboard Cite

show abstract

“…The implications of this result on the size of test suites is that one doesn't gain a great deal by excluding some of the pairwise interactions between parameters from consideration when constructing the test suites. [ 38]), and other deep results in probability theory and group theory.…”

Section: Lower Bounds and Asymptoticsmentioning

confidence: 97%

“…This means that if an array This property also ensures that given any three columns, there are precisely three rows in which not all of the entries in the row are distinct. Thus, so long as = CS , see [ 38].…”

mentioning

confidence: 99%

Software and Hardware Testing Using Combinatorial Covering Suites

Hartman

Operations Research/Computer Science Interfaces Series

146

103

View full text Add to dashboard Cite

Abstract:In the 21 st century our society is becoming more and more dependent on software systems. The safety of these systems and the quality of our lives is increasingly dependent on the quality of such systems. A key element in the manufacture and quality assurance process in software engineering is the testing of software and hardware systems. The construction of efficient combinatorial covering suites has important applications in the testing of hardware and software. In this paper we define the general problem, discuss the lower bounds on the size of covering suites, and give a series of constructions that achieve these bounds asymptotically. These constructions include the use of finite field theory, extremal set theory, group theory, coding theory, combinatorial recursive techniques, and other areas of computer science and mathematics. The study of these combinatorial covering suites is a fascinating example of the interplay between pure mathematics and the applied problems generated by software and hardware engineers. The wide range of mathematical techniques used, and the often unexpected applications of combinatorial covering suites make for a rewarding study.

show abstract

“…Algebraic approaches use formulas or operations with mathematical objects such as cyclic vectors [5], permutation vectors (Zero-sum method [6]), groups [7], cover starter [8] or covering arrays with small values of t, k, v (doubling [9] and v-plication [10] Algebraic constructions often provide a better bound in less computational time, but impose serious restrictions on the system configurations to which they can be applied. For example, many approaches for constructing covering arrays require that the domain size be a prime number or a power of a prime number; this significantly limits the applicability of algebraic approaches for testing.…”

Section: Related Workmentioning

confidence: 99%

A New Algorithm for Post-Processing Covering Arrays

Lara–Alvarez¹,

Ávila-George²

2015

ijacsa

View full text Add to dashboard Cite

Abstract-Software testing is a critical component of modern software development. For this reason, it has been one of the most active research topics for several years, resulting in many different algorithms, methodologies and tools. Combinatorial testing is one of the most important testing strategies. The test generation problem for combinatorial testing can be modeled as constructing a matrix which has certain properties, typically this matrix is a covering array. The construction of covering arrays with the fewest rows remains a challenging problem. This paper proposes a post-processing technique that repeatedly adjusts the covering array in an attempt to reduce its number of rows. In the experiment, 85 covering arrays, created by a state-of-theart algorithm, were subject to the reduction process. The results report a reduction in the size of 28 covering arrays (∼33%).

show abstract

Covering arrays and intersecting codes

Cited by 137 publications

References 38 publications

Towards Secure Two-Party Computation from the Wire-Tap Channel

Towards Secure Two-Party Computation from the Wire-Tap Channel

Software and Hardware Testing Using Combinatorial Covering Suites

A New Algorithm for Post-Processing Covering Arrays

Contact Info

Product

Resources

About