Relative \(t\)-designs in binary Hamming association scheme \(H(n,2)\)

DOI10.1007/s10623-016-0200-0zbMath1367.05027OpenAlexW2194118356MaRDI QIDQ2364622

Yan Zhu, Etsuko Bannai, Eiichi Bannai

Publication date: 21 July 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-016-0200-0

zbMATH Keywords

tight designregular \(t\)-wise balanced designrelative \(t\)-designHadamard designHamming association scheme

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30)

Related Items

Design theory from the viewpoint of algebraic combinatorics, Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials, On symmetric BIBDs with the same 3-concurrence, Euclidean designs obtained from spherical embedding of coherent configurations, Relative \(t\)-designs in Johnson association schemes for P-polynomial structure, Relative \(t\)-designs in nonbinary Hamming association schemes, Tight \(t\)-designs on one shell of Johnson association schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonexistence results for tight block designs
• On the existence of tight relative 2-designs on binary Hamming association schemes
• A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes
• Tight relative 2-designs on two shells in Johnson association schemes
• On relative \(t\)-designs in polynomial association schemes
• Fisher type inequalities for Euclidean t-designs
• A complete classification of symmetric (31, 10, 3) designs
• On tight 6-designs
• Tight 4-designs
• Tight relative 2- and 4-designs on binary Hamming association schemes
• Remarks on the concepts of \(t\)-designs
• Enumeration of Symmetric Designs (25,9,3)
• ON TIGHT DESIGNS
• Hadamard Matrices of Order 32