Covering and radius-covering arrays: constructions and classification

DOI10.1016/J.DAM.2010.03.008zbMath1231.05033OpenAlexW2065479760MaRDI QIDQ708354

P. P. Rivas Soriano, Jan-Christoph Schlage-Puchta, Gerzson Kéri, Charles J. Colbourn

Publication date: 11 October 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://biblio.ugent.be/publication/1106395

zbMATH Keywords

simulated annealingcovering arraypartition matrixclassification of codessurjective codesymbol fusion

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (21)

Construction of non-isomorphic covering arrays ⋮ Suitable Permutations, Binary Covering Arrays, and Paley Matrices ⋮ Covering arrays, augmentation, and quilting arrays ⋮ A construction for strength-3 covering arrays from linear feedback shift register sequences ⋮ Ordered covering arrays and upper bounds on covering codes ⋮ Detecting arrays for effects of single factors ⋮ Augmentation of covering arrays of strength two ⋮ Constructing new covering arrays from LFSR sequences over finite fields ⋮ Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods ⋮ New optimal covering arrays using an orderly algorithm ⋮ Structures and lower bounds for binary covering arrays ⋮ Randomized post-optimization of covering arrays ⋮ New covering array numbers ⋮ Mixed optimization combinatorial method for constructing covering arrays ⋮ Mixed covering arrays of strength three with few factors ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ A survey of methods for constructing covering arrays ⋮ Cover starters for covering arrays of strength two ⋮ Improving two recursive constructions for covering arrays ⋮ In-parameter-order strategies for covering perfect hash families ⋮ Tower of covering arrays

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Largest induced subgraphs of the n-cube that contain no 4-cycles
• A projective plane is an outstanding 2-cover
• Constraint models for the covering test problem
• Further results on the covering radius of small codes
• Tabu search for covering arrays using permutation vectors
• Covering arrays from cyclotomy
• Covering arrays of strength 3 and 4 from holey difference matrices
• Lower bounds for transversal covers
• Orthogonal arrays. Theory and applications
• Upper bounds for covering arrays by tabu search.
• Sperner systems consisting of pairs of complementary subsets
• Strength two covering arrays: existence tables and projection
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• Bounds for covering codes over large alphabets
• On the state of strength-three covering arrays
• Randomized Postoptimization of Covering Arrays
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Bounds on orthogonal arrays and resilient functions
• On the covering radius of small codes
• Classification of binary covering codes
• Group construction of covering arrays
• Covering arrays and intersecting codes
• A note on bounds for q-ary covering codes
• On generalized surjective codes
• Binary Covering Arrays and Existentially Closed Graphs
• Covering arrays of higher strength from permutation vectors
• Orthogonal Arrays of Index Unity

This page was built for publication: Covering and radius-covering arrays: constructions and classification