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

Probl. Peredachi Inf., 2016 Volume 52, Issue 2, Pages 15–36 (Mi ppi2201)

This article is cited in 1 paper

Coding Theory

Generalized Preparata codes and $2$-resolvable Steiner quadruple systems

V. A. Zinoviev, D. V. Zinoviev

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

Abstract: We consider generalized Preparata codes with a noncommutative group operation. These codes are shown to induce new partitions of Hamming codes into cosets of these Preparata codes. The constructed partitions induce $2$-resolvable Steiner quadruple systems $S(n,4,3)$ (i.e., systems $S(n,4,3)$ that can be partitioned into disjoint Steiner systems $S(n,4,2)$). The obtained partitions of systems $S(n,4,3)$ into systems $S(n,4,2)$ are not equivalent to such partitions previously known.

UDC: 621.391.15

Received: 17.03.2015
Revised: 15.11.2015


 English version:
Problems of Information Transmission, 2016, 52:2, 114–133

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025