On the number of Steiner triple systems \(S(2^m - 1, 3, 2)\) of rank \(2^m - m + 2\) over \(\mathbb{F}_2\)
From MaRDI portal
Publication:2629284
DOI10.1016/j.disc.2016.05.026zbMath1339.05033arXiv1512.00187OpenAlexW2897182257MaRDI QIDQ2629284
Publication date: 5 July 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.00187
Related Items (5)
Counting Steiner triple systems with classical parameters and prescribed rank ⋮ The number of the 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 ⋮ Fifty years of information sciences: a bibliometric overview
Cites Work
- Unnamed Item
- Unnamed Item
- Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+1\) over \(\mathbb F_2\)
- Remark on ``Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+1\) over \(\mathbb F_2\)
- There are 1239 Steiner triple systems \(STS(31)\) of 2-rank 27
- Structure of Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+2\) over \(\mathbb F_2\)
- A formula for the number of Steiner quadruple systems on 2n points of 2‐rank 2n−n
- The Steiner triple systems of order 19
- A mass formula for Steiner triple systems STS\((2^n-1)\) of 2-rank \(2^n-n\)
This page was built for publication: On the number of Steiner triple systems \(S(2^m - 1, 3, 2)\) of rank \(2^m - m + 2\) over \(\mathbb{F}_2\)