Splitting balanced incomplete block designs with block size 3 × 2

DOI10.1002/jcd.20025zbMath1057.05009OpenAlexW2151561247MaRDI QIDQ4651884

Beiliang Du

Publication date: 23 February 2005

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20025

zbMATH Keywords

splitting balanced incomplete design\(k\)-splitting \(A\)-code

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Related Items

Existence on splitting-balanced block designs with resolvability ⋮ A construction for optimal \(c\)-splitting authentication and secrecy codes ⋮ Combinatorial bounds and characterizations of splitting authentication codes ⋮ A new class of 3-fold perfect splitting authentication codes ⋮ Some new classes of 2-fold optimal or perfect splitting authentication codes ⋮ A new class of splitting 3-designs ⋮ Further results on the existence of splitting BIBDs and application to authentication codes ⋮ A new class of optimal 3-splitting authentication codes

Cites Work

• A new class of group divisible designs with block size three
• Generalized whist tournament designs
• New combinatorial designs and their applications to authentication codes and secret sharing schemes.
• (3, 6) GWhD(\(v\))---existence results
• Pitch tournament designs and other BIBDs?existence results for the case ? = 8n
• Perfect Mendelsohn designs with block size six
• Perfect Mendelsohn designs with block size six
• Nested balanced incomplete block designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item