Constructions of optimal packing designs

DOI10.1002/(SICI)1520-6610(1998)6:4%3C245::AID-JCD3%3E3.0.CO;2-FMaRDI QIDQ4222155zbMATH OpenOpenAlexFDO

Authors Jianxing Yin, Ahmed M. Assaf

Publication date 7 March 1999

Full work available at URL https://doi.org/10.1002/(sici)1520-6610(1998)6:4%3C245::aid-jcd3%3E3.0.co;2-f

zbMATH Keywords

optimal packingpacking designpacking number

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of packing and covering (05B40)

Recommendations

• scientific article; zbMATH DE number 874207
• scientific article; zbMATH DE number 1151807
• Packing designs with block size 6 and index 5

Cited in

(18)

• Some combinatorial constructions for optimal perfect deletion-correcting codes
• More-than-nearly-perfect packings and partial designs
• Existence of optimal strong partially balanced designs with block size five.
• A general construction for optimal cyclic packing designs
• A survey on maximum distance holey packings
• A systematic approach to some block design constructions
• Maximum distance holey packings and related codes
• Maximin distance designs based on densest packings
• Completely reducible super-simple designs with block size four and related super-simple packings
• The decomposition of \(K_v\) into \(K_2\times K_5\)'s
• Pattern formations and optimal packing
• New results on GDDs, covering, packing and directable designs with block size 5
• Resolvable packings ofKvwithK₂ × Kc's
• scientific article; zbMATH DE number 1151807 (Why is no real title available?)
• scientific article; zbMATH DE number 1439430 (Why is no real title available?)
• Block size five: quo vadis?
• Packing of \(K_{v}\) with certain graphs of five vertices
• Pair covering designs with block size 5

This page was built for publication: Constructions of optimal packing designs

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