Packing arrays
From MaRDI portal
Publication:596146
DOI10.1016/J.TCS.2003.06.004zbMATH Open1084.05016OpenAlexW2912680787MaRDI QIDQ596146FDOQ596146
Authors: Brett Stevens, Eric Mendelsohn
Publication date: 10 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2003.06.004
Recommendations
Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Covering arrays and intersecting codes
- The chromatic index of complete multipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Packing arrays and packing designs
- Lower bounds for transversal covers
- Title not available (Why is that?)
- Concerning the number of mutually orthogonal latin squares
- On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs
- Class-uniformly resolvable pairwise balanced designs with block size two and three
- Class-uniformly resolvable designs
- Class-uniformly resolvable designs with block sizes 2 and 3
- Title not available (Why is that?)
Cited In (11)
- Packing arrays and packing designs
- Constructing heterogeneous hash families by puncturing linear transversal designs
- Title not available (Why is that?)
- 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)