Results 191 to 200 of about 2,160 (213)

Enumeration of Steiner triple systems with subsystems

Mathematics of Computation, 2015
A Steiner triple system of order v v , an STS(
Östergård, Patric R.J., Popa, Alexandru, Kaski, Petteri   +3 more
openaire   +4 more sources

Packing Paths in Steiner Triple Systems

SIAM Journal on Discrete Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Domingos Dellamonica Jr., Vojtech Rödl
openaire   +2 more sources

On the Binary Codes of Steiner Triple Systems

Designs, Codes and Cryptography, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alphonse Baartmans, Ivan N. Landjev, Vladimir D. Tonchev   +2 more
openaire   +2 more sources

The Fine Intersection Problem for Steiner Triple Systems

Graphs and Combinatorics, 2008
The intersection of two Steiner triple systems (X,A) and (X,B) is the set A ∩ B. The fine intersection problem for Steiner triple systems is to determine for each v, the set I (v), consisting of all possible pairs (m, n) such that there exist two Steiner
Yeow Meng Chee, Alan C H Ling, Hao Shen
exaly   +1 more source

Linearly Derived Steiner Triple Systems

Designs, Codes and Cryptography, 1998
A Steiner triple system of order \(n\) \((\text{STS}(n))\) is derived if it can be extended to a Steiner quadruple system of order \(n+1\), i.e. if one can find \(n(n- 1)(n- 3)/24\) quadruples of elements of the STS such that neither of these contains a triple of the STS, and, moreover, each 3-subset which is not a triple of the STS is contained in ...
openaire   +2 more sources

Ternary codes of steiner triple systems

Journal of Combinatorial Designs, 1994
AbstractThe code over a finite field Fq of a design 𝒟 is the space spanned by the incidence vectors of the blocks. It is shown here that if 𝒟 is a Steiner triple system on v points, and if the integer d is such that 3d ≤ v < 3d+1, then the ternary code C of 𝒟 contains a subcode that can be shortened to the ternary generalized Reed‐Muller code ℛF3(2 ...
openaire   +2 more sources

On Steiner triple systems and perfect codes

Ars Comb., 1999
Summary: Using a computer implementation, we show that two more of the Steiner triple systems on 15 elements are perfect, i.e. that there are binary perfect codes of length 15, generating STS which have rank 15. This answers partially a question posed by \textit{F. Hergert} [Rend. Semin. Mat. Brescia 7, 359-366 (1984; Zbl 0557.94011)].
openaire   +1 more source

Embeddings of partial Steiner triple systems

Journal of Combinatorial Theory - Series A, 2004
Darryn Bryant
exaly  

Steiner triple systems S(2 m − 1, 3, 2) of rank 2 m − m+ 1 over $$\mathbb{F}_2$$

Problems of Information Transmission, 2012
V A Zinoviev, D V Zinoviev, Zinoviev V A
exaly  

An upper bound on the number of Steiner triple systems

Random Structures and Algorithms, 2013
Zur Luria
exaly