A group-based structure for perfect sequence covering arrays
From MaRDI portal
Recommendations
Cites work
- A diagonal form for the incidence matrices of t-subsets vs. k- subsets
- A note on scrambling permutations
- An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements
- Covering arrays and hash families
- Directed t-packings and directed t-Steiner systems
- scientific article; zbMATH DE number 525969 (Why is no real title available?)
- scientific article; zbMATH DE number 1066165 (Why is no real title available?)
- Minimal scrambling sets of simple orders
- On perfect deletion-correcting codes
- Perfect sequence covering arrays
- Scrambling permutations and entropy of hypergraphs
- Sequence covering arrays
- The CRC handbook of combinatorial designs
- The directed packing numbers DD(t,v,v), t\(\geq 4\)
Cited in
(8)- Covering arrays from m-sequences and character sums
- Perfect sequence covering arrays
- Growth of the perfect sequence covering array number
- Group construction of covering arrays
- On perfect sequence covering arrays
- A polynomial construction of perfect sequence covering arrays
- A group-based structure for perfect sequence covering arrays
- Excess coverage arrays and Levenshtein's conjecture
This page was built for publication: A group-based structure for perfect sequence covering arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692963)