Generalized Steiner Systems, GS(2,3, n, g), are equivalent to maximum constant weight codes over an alphabet of size g + 1 with distance 3 and weight 3 in which each codeword has length n. We construct Generalized Steiner Triple Systems, GS(2, 3, n, g), when g ≡ 3(mod 6).
✦ LIBER ✦
Generalized Steiner Triple Systems with Group Sizeg≡ 0,3 (mod 6)
✍ Scribed by Gen-nian Ge
- Book ID
- 106301559
- Publisher
- Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
- Year
- 2002
- Tongue
- English
- Weight
- 148 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0168-9673
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Generalized Steiner systems with block s
✍
Kevin Phelps; Carol Yin
📂
Article
📅
1997
🏛
John Wiley and Sons
🌐
English
⚖ 228 KB
👁 2 views
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