On the binary codes of Steiner triple systems
DOI10.1007/BF00130567zbMATH Open0922.05009OpenAlexW1979460411MaRDI QIDQ677158FDOQ677158
Authors: Alphonse Baartmans, Vladimir D. Tonchev, I. Landjev 
Publication date: 31 March 1997
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00130567
Recommendations
Blocking sets, ovals, (k)-arcs (51E21) Steiner systems in finite geometry (51E10) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Triple systems (05B07)
Cites Work
Cited In (14)
- Steiner triple systems of order 15 and their codes
- Steiner systems from binary codes
- Title not available (Why is that?)
- On classifying Steiner triple systems by their 3-rank
- Combinatorial game distributions of Steiner systems
- Steiner quadruple systems of small rank and extended perfect binary codes
- On Bonisoli's theorem and the block codes of Steiner triple systems
- Title not available (Why is that?)
- On the Steiner triple systems of small rank embedded into perfect binary codes
- Minimum weights of point codes of Steiner triple systems
- There exist Steiner triple systems of order 15 that do not occur in a perfect binary one‐error‐correcting code
- There exist non‐isomorphic STS(19) with equivalent point codes
- On a more general characterisation of Steiner systems
- Self-orthogonal codes constructed from weakly self-orthogonal designs invariant under an action of \(M_{11}\)
This page was built for publication: On the binary codes of Steiner triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q677158)
