A construction for strength-3 covering arrays from linear feedback shift register sequences

DOI10.1007/S10623-013-9835-2MaRDI QIDQ404947zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

combinatorial designscovering arrayslinear feedback shift registersvariable-strength orthogonal arrays

Mathematics Subject Classification ID

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)

Recommendations

• Constructing new covering arrays from LFSR sequences over finite fields
• On the state of strength-three covering arrays
• Covering arrays from m-sequences and character sums
• Covering arrays of strength three from extended permutation vectors
• Covering arrays of strength three

Cites work

• scientific article; zbMATH DE number 5130675 (Why is no real title available?)
• scientific article; zbMATH DE number 5177325 (Why is no real title available?)
• scientific article; zbMATH DE number 967590 (Why is no real title available?)
• 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
• Constructing strength three covering arrays with augmented annealing
• Covering and radius-covering arrays: constructions and classification
• Covering arrays and hash families
• Covering arrays on graphs
• Distributing hash families and covering arrays
• Finite geometry and character theory
• Linear Recurring Sequences
• Mixed covering arrays on 3-uniform hypergraphs
• Mixed covering arrays on graphs
• On the state of strength-three covering arrays
• Orthogonal arrays, primitive trinomials, and shift-register sequences
• Orthogonal arrays. Theory and applications
• Roux-type constructions for covering arrays of strengths three and four
• Variable strength covering arrays

Cited in

(15)

• Arrays for combinatorial interaction testing: a review on constructive approaches
• Covering array on the Cartesian product of hypergraphs
• A construction for strength-3 covering arrays from linear feedback shift register sequences
• Detecting arrays for effects of multiple interacting factors
• Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
• Covering arrays from \(m\)-sequences and character sums
• Sets of mutually orthogoval projective and affine planes
• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• Constructing new covering arrays from LFSR sequences over finite fields
• The Lovász local lemma and variable strength covering arrays
• Finite field constructions of combinatorial arrays
• Subspace restrictions and affine composition for covering perfect hash families
• Covering arrays of strength three from extended permutation vectors
• Algebraic modelling of covering arrays
• An extension of a construction of covering arrays

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)