Packing designs with equal-sized holes

DOI10.1016/S0378-3758(00)00269-XMaRDI QIDQ5934189zbMATH OpenFDO

Authors Jianxing Yin

Publication date 28 November 2001

Published in Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0378-3758(00)00269-X

zbMATH Keywords

holepacking designpacking number

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Review text

A packing design is a collection of \(k\)-element subsets (called blocks) out of a \(v\)-set \(V\) such that each pair of elements of the \(v\)-set is contained in at most \(\lambda\) blocks. A holey packing design (with equal-sized holes) is a packing design with the additional property that \(|V|= gu\), \(V\) is partitioned into \(u\) sets (called holes) of size \(g\), and the intersection of a block and a hole may contain at most one element. The size of the largest holey packing design with these parameters is denoted by \(P(k,\lambda ;g^u)\). In the current paper, the values of \(P(3,\lambda ;g^u)\) are determined for all positive integers \(g\), \(\lambda\), and \(u \geq 3\).

Recommendations

• Kirkman packing and covering designs with spanned holes of size 2
• Packing designs with block size 6 and index 5
• Packings in dodecads
• Packing designs with block size 5 and indexes 8, 12, 16
• scientific article; zbMATH DE number 874532

Cites work

• A new class of group divisible designs with block size three
• Balanced incomplete block designs and related designs
• Group divisible designs with block-size four
• scientific article; zbMATH DE number 3908438 (Why is no real title available?)
• scientific article; zbMATH DE number 124521 (Why is no real title available?)
• scientific article; zbMATH DE number 3485802 (Why is no real title available?)
• scientific article; zbMATH DE number 398968 (Why is no real title available?)
• scientific article; zbMATH DE number 4127214 (Why is no real title available?)
• scientific article; zbMATH DE number 3103352 (Why is no real title available?)
• The existence of uniform 5-GDDs

Cited in

(12)

• Optimal grid holey packings with block size 3 and 4
• Kirkman covering designs with even-sized holes
• On group divisible covering designs
• Existence of holey 3-GDDs of type \((u,g^t w^1)\)
• Some combinatorial constructions for optical orthogonal codes
• A survey on maximum distance holey packings
• Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property
• Group divisible packings and coverings with any minimum leave and minimum excess
• Kirkman packing and covering designs with spanned holes of size 2
• Kite-group divisible packings and coverings with any minimum leave and minimum excess
• Maximum group divisible packings with block size four
• A new combinatorial approach to the construction of constant composition codes

This page was built for publication: Packing designs with equal-sized holes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5934189)