Constructing new covering arrays from LFSR sequences over finite fields
DOI10.1016/J.DISC.2015.10.040zbMATH Open1328.05027OpenAlexW2181210596MaRDI QIDQ897312FDOQ897312
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
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
covering arraysprimitive polynomials over finite fieldsexhaustive search algorithmslinear feedback shift register sequences
Searching and sorting (68P10) Orthogonal arrays, Latin squares, Room squares (05B15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Products of mixed covering arrays of strength two
- Orthogonal Arrays of Index Unity
- Two applications (for search theory and truth functions) of Sperner type theorems
- Families of \(k\)-independent sets
- Handbook of finite fields
- Title not available (Why is that?)
- Generating necklaces
- Orthogonal arrays, primitive trinomials, and shift-register sequences
- Division of trinomials by pentanomials and orthogonal arrays
- On the state of strength-three covering arrays
- Software and hardware testing using combinatorial covering suites
- 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
- Constructing strength three covering arrays with augmented annealing
- Upper bounds for covering arrays by tabu search.
- Group construction of covering arrays
- Covering arrays of higher strength from permutation vectors
- A survey of methods for constructing covering arrays
- Cover starters for covering arrays of strength two
- Construction of mixed covering arrays of variable strength using a tabu search approach
Cited In (12)
- 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
- 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)
