Constructing new covering arrays from LFSR sequences over finite fields

DOI10.1016/j.disc.2015.10.040zbMath1328.05027OpenAlexW2181210596MaRDI QIDQ897312

Lucia Moura, Daniel Panario, Georgios Tzanakis, Brett Stevens

Publication date: 17 December 2015

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

Full work available at URL: https://doi.org/10.1016/j.disc.2015.10.040

zbMATH Keywords

covering arraysprimitive polynomials over finite fieldsexhaustive search algorithmslinear feedback shift register sequences

Mathematics Subject Classification ID

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

Related Items (10)

Covering arrays from \(m\)-sequences and character sums ⋮ Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm ⋮ An extension of a construction of covering arrays ⋮ Finite field constructions of combinatorial arrays ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ Number of \(t\)-tuples in arrays from LFSRs ⋮ Subspace restrictions and affine composition for covering perfect hash families ⋮ Covering arrays of strength three from extended permutation vectors ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma

Cites Work

• Unnamed Item
• Unnamed Item
• A construction for strength-3 covering arrays from linear feedback shift register sequences
• Divisibility of polynomials over finite fields and combinatorial applications
• Covering and radius-covering arrays: constructions and classification
• A survey of methods for constructing covering arrays
• Cover starters for covering arrays of strength two
• Constructing strength three covering arrays with augmented annealing
• Orthogonal arrays, primitive trinomials, and shift-register sequences
• Upper bounds for covering arrays by tabu search.
• Division of trinomials by pentanomials and orthogonal arrays
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• Handbook of Finite Fields
• Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach
• On the state of strength-three covering arrays
• Generating necklaces
• Group construction of covering arrays
• Products of mixed covering arrays of strength two
• Covering arrays of higher strength from permutation vectors
• Orthogonal Arrays of Index Unity

This page was built for publication: Constructing new covering arrays from LFSR sequences over finite fields