Codes of Steiner triple and quadruple systems
Let \({\mathcal D} = ({\mathcal P},{\mathcal B})\) be an incidence structure with point set \(\mathcal P\) of order \(\nu\) and with block set \(\mathcal B\). The code \(C_ p({\mathcal D})\) (of length \(\nu\)) of \(\mathcal D\) over a prime field \(F_ p\) is the subspace of the space \(F^{\mathcal P}_ p\) of all functions from \(\mathcal P\) to \(F_ p\) that is spanned by incidence vectors of the blocks of \(\mathcal D\). If every block \(\mathcal D\) is incident with precisely \(k\) points and set of \(t\) distinct points are together incident with precisely \(\lambda\) blocks, then \(\mathcal D\) is said to be \(t-(\nu,k,\lambda)\) design. A Steiner triple (quadruple) system is any \(2(\nu,3,1)\) (resp. \(3- (\nu,4,1)\)) design. If \(C\) is a code of length \(\nu\) and every codeword of \(C\) has coordinate 0 at a particular coordinate position, then the code obtained from \(C\) by deleting this coordinate position is said to be a shortened code of \(C\). Let \(d\) to be an integer such that \(2^ d-1 \leq \nu < 2^{d+1} - 1\). The authors show that if \(\mathcal D\) is a Steiner triple system, then the binary code \(C_ 2({\mathcal D})\) of \(\mathcal D\) contains a subcode that can be shortened to the binary Hamming code \({\mathcal K}_ d\) of length \(2^ d- 1\). Similarly the binary code of any Steiner quadruple system on \(\nu + 1\) points contains a subcode that can be shortened to the Reed-Muller code \({\mathcal R}(d-2,d)\) of order \(d-2\) and length \(2^ d\), where \(d\) is as above. These results are analogous with a result obtained by \textit{J. Doyen, X. Hubaut} and \textit{M. Vandensavel} in Math. Z. 163, 251-259 (1978; Zbl 0373.05011).
- Ternary codes of steiner triple systems
- Steiner systems from binary codes
- Extendable Steiner designs from finite geometries
- scientific article; zbMATH DE number 841598
- On the binary codes with parameters of doubly-shortened 1-perfect codes
- On 2-ranks of Steiner triple systems
- scientific article; zbMATH DE number 1161342
- 3-(2m, 2m–1, 2m–2–1) design for first order Reed-Muller code R(1,m)
- There exist Steiner triple systems of order 15 that do not occur in a perfect binary one‐error‐correcting code
- The construction of some bit and byte error control codes using partial Steiner systems
- scientific article; zbMATH DE number 3815655 (Why is no real title available?)
- scientific article; zbMATH DE number 4085665 (Why is no real title available?)
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3893212 (Why is no real title available?)
- On generalized ReedMuller codes and their relatives
- On projective and affine hyperplanes
- Ranks of incidence matrices of t-designs S_ (t,t+1,v)
- Bases of minimum-weight vectors for codes from designs
- Some transitive Steiner triple systems of Bagchi and Bagchi
- Steiner triple systems of order 15 and their codes
- On \(q\)-Steiner systems from rank metric codes
- On 2-ranks of Steiner triple systems
- Generalized Preparata codes and 2-resolvable Steiner quadruple systems
- Semi-distance codes and Steiner systems
- On Bonisoli's theorem and the block codes of Steiner triple systems
- Steiner systems from binary codes
- The construction of some bit and byte error control codes using partial Steiner systems
- On block sequences of Steiner quadruple systems with error correcting consecutive unions
- Steiner triple systems S(2ᵐ-1,3,2) of rank 2ᵐ-m+1 over F₂
- scientific article; zbMATH DE number 25262 (Why is no real title available?)
- scientific article; zbMATH DE number 617595 (Why is no real title available?)
- scientific article; zbMATH DE number 1145912 (Why is no real title available?)
- An Infinite Family of Steiner Systems from Cyclic Codes
- Twofold triple systems with cyclic 2‐intersecting Gray codes
- Ternary codes of steiner triple systems
- 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
- Some constructions for block sequences of Steiner quadruple systems with error correcting consecutive unions
- A mass formula for Steiner triple systems STS\((2^n-1)\) of 2-rank \(2^n-n\)
- Designer of codes: a tribute to Jennifer Key
- Perfect codes from the dual point of view. I
This page was built for publication: Codes of Steiner triple and quadruple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802189)
