Codes of Steiner triple and quadruple systems
From MaRDI portal
Publication:1802189
DOI10.1007/BF01388410zbMATH Open0779.51004OpenAlexW2023887414MaRDI QIDQ1802189FDOQ1802189
Authors: Yanyan Li 
Publication date: 18 January 1994
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01388410
Recommendations
- 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
Linear codes (general theory) (94B05) Steiner systems in finite geometry (51E10) Linear codes and caps in Galois spaces (51E22) Triple systems (05B07)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On generalized ReedMuller codes and their relatives
- Title not available (Why is that?)
- On projective and affine hyperplanes
- Title not available (Why is that?)
- Ranks of incidence matrices of t-designs \(S_\lambda (t,t+1,v)\)
Cited In (19)
- The construction of some bit and byte error control codes using partial Steiner systems
- An Infinite Family of Steiner Systems from Cyclic Codes
- Some transitive Steiner triple systems of Bagchi and Bagchi
- Twofold triple systems with cyclic 2‐intersecting Gray codes
- Steiner triple systems of order 15 and their codes
- Steiner systems from binary codes
- Title not available (Why is that?)
- Bases of minimum-weight vectors for codes from designs
- 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
- Perfect codes from the dual point of view. I
- On Bonisoli's theorem and the block codes of Steiner triple systems
- Generalized Preparata codes and 2-resolvable Steiner quadruple systems
- On \(q\)-Steiner systems from rank metric codes
- Some constructions for block sequences of Steiner quadruple systems with error correcting consecutive unions
- Semi-distance codes and Steiner systems
- Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+1\) over \(\mathbb F_2\)
- On 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\)
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)
