A construction for strength-3 covering arrays from linear feedback shift register sequences
DOI10.1007/S10623-013-9835-2zbMATH Open1297.05040OpenAlexW2052060691MaRDI QIDQ404947FDOQ404947
Authors: Sebastian Raaphorst, Lucia Moura, Brett Stevens 
Publication date: 4 September 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9835-2
Recommendations
combinatorial designscovering arrayslinear feedback shift registersvariable-strength orthogonal arrays
Combinatorial aspects of block designs (05B05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Orthogonal arrays. Theory and applications
- Finite geometry and character theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Covering arrays on graphs
- Orthogonal arrays, primitive trinomials, and shift-register sequences
- Mixed covering arrays on 3-uniform hypergraphs
- On the state of strength-three covering arrays
- Covering arrays and hash families
- Linear Recurring Sequences
- Title not available (Why is that?)
- A construction for strength-3 covering arrays from linear feedback shift register sequences
- Variable strength covering arrays
- Distributing hash families and covering arrays
- Mixed covering arrays on graphs
- Covering and radius-covering arrays: constructions and classification
- Roux-type constructions for covering arrays of strengths three and four
- Constructing strength three covering arrays with augmented annealing
Cited In (15)
- A construction for strength-3 covering arrays from linear feedback shift register sequences
- The Lovász local lemma and variable strength covering arrays
- Asymptotic and constructive methods for covering perfect hash families and covering arrays
- Algebraic modelling of covering arrays
- Covering array on the Cartesian product of hypergraphs
- Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
- Sets of mutually orthogoval projective and affine planes
- Subspace restrictions and affine composition for covering perfect hash families
- An extension of a construction of covering arrays
- Constructing new covering arrays from LFSR sequences over finite fields
- 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
This page was built for publication: A construction for strength-3 covering arrays from linear feedback shift register sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404947)
