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

DOI10.1007/S10623-016-0200-0MaRDI QIDQ2364622zbMATH OpenOpenAlexFDO

Authors Eiichi Bannai, Etsuko Bannai, Yan Zhu

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

Hadamard designHamming association schemeregular \(t\)-wise balanced designrelative \(t\)-designtight design

Mathematics Subject Classification ID

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

Recommendations

• Tight relative 2- and 4-designs on binary Hamming association schemes
• On the existence of tight relative 2-designs on binary Hamming association schemes
• Note on the tight relative 2-designs on \(H(n,2)\)
• Tight relative 6-designs on binary Hamming association schemes
• Relative \(t\)-designs in nonbinary Hamming association schemes

Cites work

• A complete classification of symmetric (31, 10, 3) designs
• A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes
• Enumeration of Symmetric Designs (25,9,3)
• Fisher type inequalities for Euclidean t-designs
• Hadamard matrices of order 32
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 21748 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3592520 (Why is no real title available?)
• scientific article; zbMATH DE number 1382769 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Nonexistence results for tight block designs
• On relative \(t\)-designs in polynomial association schemes
• On the existence of tight relative 2-designs on binary Hamming association schemes
• On tight 6-designs
• ON TIGHT DESIGNS
• Remarks on the concepts of t-designs
• The CRC handbook of combinatorial designs
• Tight 4-designs
• Tight relative 2- and 4-designs on binary Hamming association schemes
• Tight relative 2-designs on two shells in Johnson association schemes

Cited in

(16)

• On symmetric BIBDs with the same 3-concurrence
• Harmonic index designs in binary Hamming schemes
• Relative t-designs in Johnson association schemes for P-polynomial structure
• Relative \(t\)-designs in nonbinary Hamming association schemes
• On tight 4-designs in Hamming association schemes
• Tight \(t\)-designs on one shell of Johnson association schemes
• Design theory from the viewpoint of algebraic combinatorics
• Tight relative 2- and 4-designs on binary Hamming association schemes
• An orthogonal base for the tight relative 2-designs in H(n,3)
• Tight relative 6-designs on binary Hamming association schemes
• On the existence of tight relative 2-designs on binary Hamming association schemes
• Note on the tight relative 2-designs on \(H(n,2)\)
• A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes
• Tight relative \(t\)-designs on two shells in hypercubes, and Hahn and Hermite polynomials
• Euclidean designs obtained from spherical embedding of coherent configurations
• Tight relative 2-designs on two shells in Johnson association schemes

This page was built for publication: Relative \(t\)-designs in binary Hamming association scheme \(H(n,2)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364622)