๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

1-Rotational Steiner triple systems over arbitrary groups

โœ Scribed by Marco Buratti


Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
163 KB
Volume
9
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The spectrum for rotational Steiner trip
โœ Charles J. Colbourn; Zhike Jiang ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 700 KB

We develop some recursive constructions for rotational Steiner triple systems with which the spectrum of a k-rotational Steiner triple system of order v is completely determined for each positive integer k .

Generalized steiner triple systems with
โœ K. Chen; G. Ge; L. Zhu ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 154 KB ๐Ÿ‘ 2 views

Generalized Steiner triple systems, GS(2, 3, n, g) are used to construct maximum constant weight codes over an alphabet of size g 1 with distance 3 and weight 3 in which each codeword has length n. The existence of GS(2, 3, n, g) has been solved for g 2, 3, 4, 9. In this paper, by introducing a spec

A Mass Formula for Steiner Triple System
โœ Vladimir D. Tonchev ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 116 KB

A formula is found for the total number of distinct Steiner triple systems on 2 n &1 points whose 2-rank is one higher than the possible minimum 2 n &n&1. The formula can be used for deriving bounds on the number of pairwise nonisomorphic systems for large n, and for the classification of all noniso