A construction for strength-3 covering arrays from linear feedback shift register sequences
DOI10.1007/s10623-013-9835-2zbMath1297.05040OpenAlexW2052060691MaRDI QIDQ404947
Lucia Moura, Brett Stevens, Sebastian Raaphorst
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
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)
Related Items (12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction for strength-3 covering arrays from linear feedback shift register sequences
- 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
- Orthogonal arrays, primitive trinomials, and shift-register sequences
- Orthogonal arrays. Theory and applications
- Finite geometry and character theory
- Mixed covering arrays on 3-uniform hypergraphs
- Covering arrays on graphs
- On the state of strength-three covering arrays
- Linear Recurring Sequences
- Variable strength covering arrays
- Mixed covering arrays on graphs
This page was built for publication: A construction for strength-3 covering arrays from linear feedback shift register sequences