Results 201 to 210 of about 2,403 (227)

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 Spectrum of Orthogonal Steiner Triple Systems

Canadian Journal of Mathematics, 1994
AbstractTwo Steiner triple systems (V, 𝓑) and (V, 𝓓) are orthogonal if they have no triples in common, and if for every two distinct intersecting triples {x,y,z} and {x, y, z} of 𝓑, the two triples {x,y,a} and {u, v, b} in (𝓓 satisfy a ≠ b. It is shown here that if v ≡ 1,3 (mod 6), v ≥ 7 and v ≠ 9, a pair of orthogonal Steiner triple systems of order v
Colbourn, Charles J., Gibbons, Peter B., Mathon, Rudolf, Mullin, Ronald C., Rosa, Alexander   +4 more
openaire   +2 more sources

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

Configurations and trades in Steiner triple systems [PDF]

Australas. J Comb., 2004
An \(m\)-line configuration is a partial Steiner triple system comprising \(m\) blocks. A trade set \(\{T_1,T_2,\dots,T_n\}\), \(n>1\), of volume \(m\), is a set of pairwise disjoint \(m\)-line configurations with the property that every pair of distinct elements occurs in the same number of triples of each \(T_i\).
Anthony D. Forbes, Mike J. Grannell, Terry S. Griggs   +2 more
openaire   +1 more source

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

A proof of Lindner's conjecture on embeddings of partial Steiner triple systems

Journal of Combinatorial Designs, 2009
Darryn Bryant, Daniel Horsley
exaly  

The convolution of a partial Steiner triple system and a group

Journal of Geometry, 2006
Małgorzata Prazmowska, Prazmowska Małgorzata, Prażmowski Krzysztof   +2 more
exaly  

The spectrum of nested Steiner triple systems

Graphs and Combinatorics, 1985
D R Stinson
exaly