Vasil'ev codes of length \(n=2^m\) and doubling of Steiner systems \(S(n,4,3)\) of a given rank

DOI10.1134/S0032946006010029zbMath1096.94046OpenAlexW1974023976MaRDI QIDQ2498319

Dmitrii Zinoviev, Victor A. Zinoviev

Publication date: 16 August 2006

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946006010029

zbMATH Keywords

Orders of the automorphism groups

Mathematics Subject Classification ID

Steiner systems in finite geometry (51E10) Other types of codes (94B60)

Related Items (2)

On resolvability of Steiner systems \(S ( v = 2^{ m }, 4, 3)\) of rank \(r \leq v - m + 1\) over \(\mathbb{F}_{2}\) ⋮ Structure of Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+2\) over \(\mathbb F_2\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On projective and affine hyperplanes
• Ranks of incidence matrices of Steiner triple systems
• Steiner quadruple systems - a survey
• Binary extended perfect codes of length 16 by the generalized concatenated construction
• The classification of some perfect codes
• Binary perfect codes of length 15 by the generalized concatenated construction
• Classification of Steiner quadruple systems of order 16 and rank at most 13
• A Combinatorial Construction of Perfect Codes
• A formula for the number of Steiner quadruple systems on 2ⁿ points of 2‐rank 2ⁿ−n
• On generalized concatenated constructions of perfect binary nonlinear codes

This page was built for publication: Vasil'ev codes of length \(n=2^m\) and doubling of Steiner systems \(S(n,4,3)\) of a given rank