Steiner systems from binary codes
From MaRDI portal
Recommendations
Cited in
(21)- Extendable Steiner designs from finite geometries
- On \(q\)-Steiner systems from rank metric codes
- Codes of Steiner triple and quadruple systems
- Binary Hamming codes and Boolean designs
- Semi-distance codes and Steiner systems
- On Bonisoli's theorem and the block codes of Steiner triple systems
- Steiner systems for two-stage disjunctive testing
- On a more general characterisation of Steiner systems
- scientific article; zbMATH DE number 3880584 (Why is no real title available?)
- The construction of some bit and byte error control codes using partial Steiner systems
- scientific article; zbMATH DE number 25262 (Why is no real title available?)
- scientific article; zbMATH DE number 617595 (Why is no real title available?)
- An Infinite Family of Steiner Systems from Cyclic Codes
- There exist non‐isomorphic STS(19) with equivalent point codes
- On the Steiner quadruple systems of small rank which are embeddable into extended perfect binary codes
- Steiner quadruple systems of small rank and extended perfect binary codes
- A mass formula for Steiner triple systems STS\((2^n-1)\) of 2-rank \(2^n-n\)
- Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes
- Bussey systems and Steiner's tactical problem
- On the binary codes of Steiner triple systems
- Designer of codes: a tribute to Jennifer Key
This page was built for publication: Steiner systems from binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760995)
