Abstract
The parameters $2$ - $(2\lambda+2,\lambda+1,\lambda)$ are those of a residual Hadamard $2$ - $(4\lambda+3,2\lambda+1,\lambda)$ design. All $2$ - $(2\lambda+2,\lambda+1,\lambda)$ designs with $\lambda \le 4$ are embeddable. The existence of non-embeddable Hadamard $2$-designs has been determined for the cases $\lambda = 5$, $\lambda = 6$, and $\lambda = 7$. In this paper the existence of an infinite family of non-embeddable $2$ - $(2\lambda+2,\lambda+1,\lambda)$ designs, $\lambda = 3(2^m) - 1, m \ge 1$ is established.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献