RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2007 Volume 43, Issue 1, Pages 39–55 (Mi ppi5)

This article is cited 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$.

UDC: 621.391.1:519.2

Received: 14.02.2006
Revised: 12.09.2006


 English version:
Problems of Information Transmission, 2007, 43:1, 33–47

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025