A group-based structure for perfect sequence covering arrays

DOI10.1007/s10623-022-01132-1OpenAlexW4307573434MaRDI QIDQ2692963

Shuxing Li, Jingzhou Na, Jonathan Jedwab

Publication date: 17 March 2023

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

Full work available at URL: https://arxiv.org/abs/2202.01948

zbMATH Keywords

search algorithmgroup theorycombinatorial design theoryperfect sequence covering array

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Spreads and packing problems in finite geometry (51E23) Combinatorial aspects of packing and covering (05B40)

Related Items (3)

On perfect sequence covering arrays ⋮ A polynomial construction of perfect sequence covering arrays ⋮ Growth of the perfect sequence covering array number

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The directed packing numbers DD(t,v,v), t\(\geq 4\)
• An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements
• Directed \(t\)-packings and directed \(t\)-Steiner systems
• A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)- subsets
• Perfect sequence covering arrays
• A note on scrambling permutations
• On perfect deletion-correcting codes
• Scrambling permutations and entropy of hypergraphs
• Sequence Covering Arrays
• Minimal scrambling sets of simple orders

This page was built for publication: A group-based structure for perfect sequence covering arrays