Generalized Preparata codes and 2-resolvable Steiner quadruple systems
- Authors: Zinoviev V.A.1, Zinoviev D.V.1
-
Affiliations:
- Kharkevich Institute for Information Transmission Problems
- Issue: Vol 52, No 2 (2016)
- Pages: 114-133
- Section: Coding Theory
- URL: https://journals.rcsi.science/0032-9460/article/view/166274
- DOI: https://doi.org/10.1134/S0032946016020022
- ID: 166274
Cite item
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.
About the authors
V. A. Zinoviev
Kharkevich Institute for Information Transmission Problems
Author for correspondence.
Email: zinov@iitp.ru
Russian Federation, Moscow
D. V. Zinoviev
Kharkevich Institute for Information Transmission Problems
Email: zinov@iitp.ru
Russian Federation, Moscow
Supplementary files
