Harmonic index designs in binary Hamming schemes

DOI10.1007/s00373-017-1784-5zbMath1387.05035OpenAlexW2617248598MaRDI QIDQ1696524

Kyoung-Tark Kim, Etsuko Bannai, Yan Zhu, Eiichi Bannai, Ikuta, Takuya

Publication date: 14 February 2018

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

Full work available at URL: https://doi.org/10.1007/s00373-017-1784-5

zbMATH Keywords

addition formulatight designFisher type lower boundHamming association schemeharmonic index design

Mathematics Subject Classification ID

Linear programming (90C05) Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30)

Related Items (3)

Design theory from the viewpoint of algebraic combinatorics ⋮ Harmonic index \(t\)-designs in the Hamming scheme for arbitrary \(q\) ⋮ Relative \(t\)-designs in nonbinary Hamming association schemes

Uses Software

• SageMath

Cites Work

• A generalization of Larman-Rogers-Seidel's theorem
• t-designs in projective spaces
• A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
• On orthogonal arrays of strength 3 and 5 achieving Rao's bound
• Designs as maximum codes in polynomial metric spaces
• Spherical codes and designs
• Neural ideals in SageMath
• Spherical designs of harmonic index \(t\)
• On Two-Distance Sets in Euclidean Space
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Harmonic index designs in binary Hamming schemes