Growth of the perfect sequence covering array number

DOI10.1007/S10623-022-01168-3MaRDI QIDQ2697491zbMATH OpenOpenAlexFDO

Authors Enrico Iurlano

Publication date 12 April 2023

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10623-022-01168-3

zbMATH Keywords

directed designfamily of permutationsmin-wise independencesequence covering array

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other designs, configurations (05B30) Combinatorial aspects of packing and covering (05B40) Extremal combinatorics (05D99)

Recommendations

• Perfect sequence covering arrays
• A group-based structure for perfect sequence covering arrays
• Sequence covering arrays
• Sequence Covering Arrays and Linear Extensions
• Asymptotic and constructive methods for covering perfect hash families and covering arrays

Cites work

• A group-based structure for perfect sequence covering arrays
• A nearly linear size \(4\)-min-wise independent permutation family by finite geometries
• scientific article; zbMATH DE number 525969 (Why is no real title available?)
• scientific article; zbMATH DE number 1445297 (Why is no real title available?)
• scientific article; zbMATH DE number 2187718 (Why is no real title available?)
• Min-wise independent permutations
• Minimal scrambling sets of simple orders
• Perfect sequence covering arrays
• Sequence covering arrays

Cited in

(7)

• Perfect sequence covering arrays
• A group-based structure for perfect sequence covering arrays
• Suitable permutations, binary covering arrays, and Paley matrices
• On perfect sequence covering arrays
• A polynomial construction of perfect sequence covering arrays
• Excess coverage arrays and Levenshtein's conjecture
• Explicit and near-optimal construction of t-rankwise independent permutations

This page was built for publication: Growth of the perfect sequence covering array number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2697491)