|
This article is cited in 6 scientific papers (total in 6 papers)
Coding Theory
On Resolvability of Steiner Systems $S(v=2^m,4,3)$
of Rank $r\le v-m+1$ over $\mathbb F_2$
V. A. Zinov'ev, D. V. Zinov'ev A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences
Abstract:
Two new constructions of Steiner quadruple systems $S(v,4,3)$ are given. Both
preserve resolvability of the original Steiner system and make it possible to control the rank of
the resulting system. It is proved that any Steiner system $S(v=2^m,4,3)$ of rank $r\le v-m+1$ over $\mathbb F_2$ is resolvable and that all systems of this rank can be constructed in this way. Thus, we
find the number of all different Steiner systems of rank $r=v-m+1$.
Received: 14.02.2006 Revised: 12.09.2006
Citation:
V. A. Zinov'ev, D. V. Zinov'ev, “On Resolvability of Steiner Systems $S(v=2^m,4,3)$
of Rank $r\le v-m+1$ over $\mathbb F_2$”, Probl. Peredachi Inf., 43:1 (2007), 39–55; Problems Inform. Transmission, 43:1 (2007), 33–47
Linking options:
https://www.mathnet.ru/eng/ppi5 https://www.mathnet.ru/eng/ppi/v43/i1/p39
|
Statistics & downloads: |
Abstract page: | 550 | Full-text PDF : | 121 | References: | 74 | First page: | 6 |
|