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

On complete arcs in Steiner systems S(2, 3, v) and S(2, 4, v)

โœ Scribed by Marialuisa J. de Resmini

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
594 KB
Volume
77
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The complete classification of Steiner s
The complete classification of Steiner systems S(2, 4, 25)
โœ Edward Spence ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 341 KB ๐Ÿ‘ 1 views

We describe an algorithm that was used to classify completely all Steiner systems S(2,4,25). The result is that in addition to the 16 nonisomorphic designs with nontrivial automorphism group already known, there are precisely two such nonisomorphic designs with a trivial automorphism group.

4-*GDDs(3n) and generalized Steiner syst
4-*GDDs(3n) and generalized Steiner systems GS(2, 4, v, 3)
โœ G. Ge; D. Wu ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 137 KB

## Abstract Generalized Steiner systems GS(2, __k__, __v__, __g__) were first introduced by Etzion and used to construct optimal constant weight codes over an alphabet of size __g__โ€‰+โ€‰1 with minimum Hamming distance 2__k__โ€‰โˆ’โ€‰3, in which each codeword has length __v__ and weight __k__. As to the exi

Generalized Steiner systems GS4 (2, 4, v
Generalized Steiner systems GS4 (2, 4, v, g) for g = 2, 3, 6
โœ D. Wu; G. Ge; L. Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 211 KB

Generalized Steiner systems GS d tY kY vY g were ยฎrst introduced by Etzion and used to construct optimal constant-weight codes over an alphabet of size g 1 with minimum Hamming distance d, in which each codeword has length v and weight k. Much work has been done for the existence of generalized Stei