Combinatorial designs and perfect codes

DOI10.1016/S1571-0653(04)00398-1zbMath1171.05312MaRDI QIDQ3438986

Kevin T. Phelps

Publication date: 29 May 2007

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

Mathematics Subject Classification ID

Other designs, configurations (05B30) Combinatorial codes (94B25)

Related Items

Completion and deficiency problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite partial quadruple systems can be finitely embedded
• The triply shortened binary Hamming code is optimal
• Constant weight codes and group divisible designs
• Optimal constant weight codes over \(Z_k\) and generalized designs
• Starters and related codes
• The completion of finite incomplete Steiner triple systems with applications to loop theory
• Perfect codes hardly exist
• A Survey of Embedding Theorems for Steiner Systems
• Generalized Steiner systems with block size three and group sizeg ? 3(mod 6)
• Generalized steiner triple systems with group size five

This page was built for publication: Combinatorial designs and perfect codes