Packing arrays
From MaRDI portal
Publication:596146
Recommendations
Cites work
- scientific article; zbMATH DE number 1286223 (Why is no real title available?)
- scientific article; zbMATH DE number 867473 (Why is no real title available?)
- scientific article; zbMATH DE number 894713 (Why is no real title available?)
- scientific article; zbMATH DE number 2188416 (Why is no real title available?)
- Class-uniformly resolvable designs
- Class-uniformly resolvable designs with block sizes 2 and 3
- Class-uniformly resolvable pairwise balanced designs with block size two and three
- Concerning the number of mutually orthogonal latin squares
- Covering arrays and intersecting codes
- Lower bounds for transversal covers
- On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs
- Packing arrays and packing designs
- The chromatic index of complete multipartite graphs
Cited in
(11)- Packing arrays and packing designs
- Constructing heterogeneous hash families by puncturing linear transversal designs
- scientific article; zbMATH DE number 2086236 (Why is no real title available?)
- Classification of orthogonal arrays by integer programming
- Generalized packing designs
- A survey of cover-free families: constructions, applications, and generalizations
- Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods
- On constant composition codes
- Space defragmentation for packing problems
- A note on full transversals and mixed orthogonal arrays
- Array Folds Logic
This page was built for publication: Packing arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596146)