Relative t-designs in binary Hamming association scheme H(n,2)
Eiichi Bannai, Etsuko Bannai, Yan Zhu

TL;DR
This paper studies relative t-designs in binary Hamming schemes, focusing on Fisher inequalities, existence of tight designs, and their connections to classical combinatorial designs, providing new families and open problems.
Contribution
It introduces new results on the structure and parameters of tight relative t-designs, especially on two shells, and links them to classical design theory.
Findings
Proved that constant weight functions imply subsets are (t-1)-designs.
Discovered new families of tight relative t-designs for odd t.
Provided feasible parameter lists for t=3 and t=4 designs up to certain n.
Abstract
A relative t-design in the binary Hamming association schemes H(n,2) is equivalent to a weighted regular t-wise balanced design, i.e., certain combinatorial t-design which allow different sizes of blocks and a weight function on blocks. In this paper, we study relative t-designs in H(n,2), putting emphasis on Fisher type inequalities and the existence of tight relative t-designs. We mostly consider relative t-designs on two shells. We prove that if the weight function is constant on each shell of a relative t-design on two shells then the subset in each shell must be a combinatorial (t-1)-design. This is a generalization of the result of Kageyama who proved this under the stronger assumption that the weight function is constant on the whole block set. Using this, we define tight relative t-designs for odd t, and a strong restriction on the possible parameters of tight relative t-designs…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Mathematical Approximation and Integration
