A formula for the number of Steiner quadruple systems on 2n points of 2‐rank 2n−n
From MaRDI portal
Publication:4416297
DOI10.1002/JCD.10036zbMath1029.05014OpenAlexW2037364571MaRDI QIDQ4416297
Publication date: 31 July 2003
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.10036
Related Items (11)
On the number of Steiner triple systems \(S(2^m - 1, 3, 2)\) of rank \(2^m - m + 2\) over \(\mathbb{F}_2\) ⋮ The number of the non-full-rank Steiner quadruple systems \(S ( v , 4 , 3 )\) ⋮ Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+1\) over \(\mathbb F_2\) ⋮ Classification of Steiner quadruple systems of order 16 and rank 14 ⋮ On resolvability of Steiner systems \(S ( v = 2^{ m }, 4, 3)\) of rank \(r \leq v - m + 1\) over \(\mathbb{F}_{2}\) ⋮ Steiner systems for two-stage disjunctive testing ⋮ Non-full-rank Steiner quadruple systems \(S(v,4,3)\) ⋮ On one transformation of Steiner quadruple systems \(S(\upsilon , 4, 3)\) ⋮ Vasil'ev codes of length \(n=2^m\) and doubling of Steiner systems \(S(n,4,3)\) of a given rank ⋮ Binary Hamming codes and Boolean designs ⋮ Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes
Cites Work
This page was built for publication: A formula for the number of Steiner quadruple systems on 2n points of 2‐rank 2n−n
