Structure of Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+2\) over \(\mathbb F_2\)
From MaRDI portal
Publication:2262975
DOI10.1134/S0032946013030034zbMath1308.05025OpenAlexW2022280486MaRDI QIDQ2262975
Dmitrii Zinoviev, Victor A. Zinoviev
Publication date: 17 March 2015
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946013030034
Related Items (6)
On the number of Steiner triple systems \(S(2^m - 1, 3, 2)\) of rank \(2^m - m + 2\) over \(\mathbb{F}_2\) ⋮ Counting Steiner triple systems with classical parameters and prescribed rank ⋮ On one construction method for Hadamard matrices ⋮ Non-full-rank Steiner quadruple systems \(S(v,4,3)\) ⋮ The projective general linear group \(\mathrm{PGL}(2,2^m)\) and linear codes of length \(2^m+1\) ⋮ Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes
Cites Work
- Unnamed Item
- Unnamed Item
- Classification of Steiner quadruple systems of order 16 and rank 14
- Ranks of incidence matrices of Steiner triple systems
- Steiner quadruple systems - a survey
- Vasil'ev codes of length \(n=2^m\) and doubling of Steiner systems \(S(n,4,3)\) of a given rank
- A General Product Construction for Error Correcting Codes
- A Combinatorial Construction of Perfect Codes
- On the Steiner quadruple systems of small rank which are embeddable into extended perfect binary codes
- The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties
- The number of latin squares of order eight
- On one-factorizations of complete graphs
- On generalized concatenated constructions of perfect binary nonlinear codes
- A mass formula for Steiner triple systems STS\((2^n-1)\) of 2-rank \(2^n-n\)
This page was built for publication: Structure of Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+2\) over \(\mathbb F_2\)
