Tight relative 2- and 4-designs on binary Hamming association schemes

DOI10.1007/s00373-012-1252-1zbMath1295.05275OpenAlexW1985903051MaRDI QIDQ2441355

Etsuko Bannai, Eiichi Bannai, Zengti Li

Publication date: 24 March 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1252-1

zbMATH Keywords

association schemetight designHamming schemerelative \(t\)-design

Mathematics Subject Classification ID

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

Related Items

Design theory from the viewpoint of algebraic combinatorics, Relative \(t\)-designs in binary Hamming association scheme \(H(n,2)\), Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials, Tight relative 2-designs on two shells in Johnson association schemes, On relative \(t\)-designs in polynomial association schemes, A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes, Relative \(t\)-designs in Johnson association schemes for P-polynomial structure, Tight \(t\)-designs on one shell of Johnson association schemes

Cites Work

• Fisher type inequalities for Euclidean t-designs
• Tight 4-designs
• Remarks on the concepts of \(t\)-designs
• On Orthogonal Arrays of Strength 4 Achieving Rao's Bound
• Square λ-Linked Designs
• Unnamed Item
• Unnamed Item
• Unnamed Item