On 2-ranks of Steiner triple systems

zbMath0815.05016MaRDI QIDQ1804181

Edward F. jun. Assmus

Publication date: 25 April 1995

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_2/volume2.html#R9

zbMATH Keywords

classificationcarrierbinary codesenumerationsReed-Muller codeSteiner triple systems2-rankSteiner quadruple systemsresolvable quadruple system

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Triple systems (05B07)

Related Items (9)

Counting Steiner triple systems with classical parameters and prescribed rank ⋮ Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+1\) over \(\mathbb F_2\) ⋮ On Bonisoli's theorem and the block codes of Steiner triple systems ⋮ On resolvability of Steiner systems \(S ( v = 2^{ m }, 4, 3)\) of rank \(r \leq v - m + 1\) over \(\mathbb{F}_{2}\) ⋮ The classification of Steiner triple systems on 27 points with 3-rank 24 ⋮ There exist non‐isomorphic STS(19) with equivalent point codes ⋮ A mass formula for Steiner triple systems STS\((2^n-1)\) of 2-rank \(2^n-n\) ⋮ Binary Hamming codes and Boolean designs ⋮ Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)

This page was built for publication: On 2-ranks of Steiner triple systems