Covering arrays of strength three from extended permutation vectors

DOI10.1007/s10623-018-0465-6zbMath1396.05018OpenAlexW2794160495MaRDI QIDQ1791674

Idelfonso Izquierdo-Marquez, Jose Torres-Jimenez

Publication date: 10 October 2018

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-018-0465-6

zbMATH Keywords

covering arrayslinear feedback shift register sequencescovering perfect hash familiesextended permutation vectors

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)

Related Items (6)

Consecutive detecting arrays for interaction faults ⋮ Shrinking generators based on \(\sigma \)-LFSRs ⋮ An extension of a construction of covering arrays ⋮ Subspace restrictions and affine composition for covering perfect hash families ⋮ Improved covering arrays using covering perfect hash families with groups of restricted entries ⋮ In-parameter-order strategies for covering perfect hash families

Cites Work

• A construction for strength-3 covering arrays from linear feedback shift register sequences
• Constructing new covering arrays from LFSR sequences over finite fields
• Tabu search for covering arrays using permutation vectors
• Covering arrays of higher strength from permutation vectors
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Covering arrays of strength three from extended permutation vectors