|
Problemy Peredachi Informatsii, 2014, Volume 50, Issue 3, Pages 76–86
(Mi ppi2145)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Coding Theory
Non-full-rank Steiner quadruple systems $S(v,4,3)$
V. A. Zinoviev, D. V. Zinoviev Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Abstract:
All different Steiner systems $S(2^m,4,3)$ of order $2^m$ and rank $2^m-m-1+s$ over $\mathbb F_2$, where $0\le s\le m-1$, are constructed. The number of different systems $S(2^m,4,3)$ whose incident matrices are orthogonal to a fixed code is obtained. A connection between the number of different Steiner systems and of different Latin cubes is described.
Received: 11.11.2013 Revised: 29.05.2014
Citation:
V. A. Zinoviev, D. V. Zinoviev, “Non-full-rank Steiner quadruple systems $S(v,4,3)$”, Probl. Peredachi Inf., 50:3 (2014), 76–86; Problems Inform. Transmission, 50:3 (2014), 270–279
Linking options:
https://www.mathnet.ru/eng/ppi2145 https://www.mathnet.ru/eng/ppi/v50/i3/p76
|
Statistics & downloads: |
Abstract page: | 252 | Full-text PDF : | 61 | References: | 42 | First page: | 11 |
|