Packing arrays

DOI10.1016/j.tcs.2003.06.004zbMath1084.05016OpenAlexW2912680787MaRDI QIDQ596146

Eric Mendelsohn, Brett Stevens

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

zbMATH Keywords

MDS codesMatchingsOrthogonal arraysPartial Latin squaresPartial match queriesTransversal designs

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)

Related Items (5)

Generalized packing designs ⋮ Constructing heterogeneous hash families by puncturing linear transversal designs ⋮ Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods ⋮ Classification of orthogonal arrays by integer programming ⋮ On constant composition codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing arrays and packing designs
• 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
• Lower bounds for transversal covers
• Concerning the number of mutually orthogonal latin squares
• The chromatic index of complete multipartite graphs
• Class-uniformly resolvable designs with block sizes 2 and 3
• Covering arrays and intersecting codes

This page was built for publication: Packing arrays