Existence of optimal strong partially balanced designs with block size five.

DOI10.1016/S0012-365X(03)00268-1zbMath1045.05011MaRDI QIDQ1428521

Beiliang Du

Publication date: 29 March 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

authentication codetransversal designpartially balanced \(t\)-design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (5)

Existence of optimal strong partially balanced 3-designs with block size four ⋮ The spectrum of optimal strong partially balanced designs with block size five ⋮ Existence of resolvable optimal strong partially balanced designs ⋮ On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration ⋮ Resolvable optimal strong partially balanced designs with block size four

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Existence of incomplete transversal designs with block size five and any index \(\lambda\)
• Four MOLS of order 10 with a hole of order 2
• On sets of three mols with holes
• Balanced incomplete block designs and related designs
• On the existence of incomplete transversal designs with block size five
• Some direct constructions for incomplete transversal designs
• Perfect Mendelsohn packing designs with block size five
• The existence of three idempotent IMOLS
• Information-theoretic bounds for authentication codes and block designs
• Existence of optimal strong partially balanced designs
• The existence of uniform 5-GDDs
• Constructions of optimal packing designs
• Some results on (v,{5,w*})‐pbds
• Resolvable group-divisible designs with block size four

This page was built for publication: Existence of optimal strong partially balanced designs with block size five.