Constructing new covering arrays from LFSR sequences over finite fields

DOI10.1016/J.DISC.2015.10.040MaRDI QIDQ897312zbMATH OpenOpenAlexFDO

Authors Georgios Tzanakis, Lucia Moura, Daniel Panario, 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)

Recommendations

• A construction for strength-3 covering arrays from linear feedback shift register sequences
• Finite field constructions of combinatorial arrays
• Linear recurrent sequences over a finite field and applications in cryptography
• Partial covering sequences: a method for designing classes of cryptographic functions
• Covering arrays from m-sequences and character sums
• On pseudorandom binary sequences constructed by using finite fields
• The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields
• Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials
• Covering arrays from cyclotomy
• A survey of methods for constructing covering arrays

Cites work

• scientific article; zbMATH DE number 2238187 (Why is no real title available?)
• A construction for strength-3 covering arrays from linear feedback shift register sequences
• A survey of methods for constructing covering arrays
• Constructing strength three covering arrays with augmented annealing
• Construction of mixed covering arrays of variable strength using a tabu search approach
• Cover starters for covering arrays of strength two
• Covering and radius-covering arrays: constructions and classification
• Covering arrays of higher strength from permutation vectors
• Divisibility of polynomials over finite fields and combinatorial applications
• Division of trinomials by pentanomials and orthogonal arrays
• Families of \(k\)-independent sets
• Generating necklaces
• Group construction of covering arrays
• Handbook of finite fields
• On the state of strength-three covering arrays
• Orthogonal Arrays of Index Unity
• Orthogonal arrays, primitive trinomials, and shift-register sequences
• Products of mixed covering arrays of strength two
• Software and hardware testing using combinatorial covering suites
• Two applications (for search theory and truth functions) of Sperner type theorems
• Upper bounds for covering arrays by tabu search.

Cited in

(14)

• A construction for strength-3 covering arrays from linear feedback shift register sequences
• Partial covering sequences: a method for designing classes of cryptographic functions
• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
• Number of \(t\)-tuples in arrays from LFSRs
• Subspace restrictions and affine composition for covering perfect hash families
• Mixed-level covering, locating, and detecting arrays via cyclotomy
• An extension of a construction of covering arrays
• Finite field constructions of combinatorial arrays
• Covering arrays of strength three from extended permutation vectors
• Detecting arrays for effects of multiple interacting factors
• Covering arrays from m-sequences and character sums
• Arrays for combinatorial interaction testing: a review on constructive approaches
• Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm

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

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