论文信息 - Generalized steiner triple systems with group size five

Generalized steiner triple systems with group size five

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 special kind of holey generalized Steiner triple systems (denoted by HGS(2, 3, (n, u), g)), singular indirect product (SIP) construction for GDDs is used to construct generalized Steiner systems. The numerical necessary conditions for the existence of a GS(2, 3, n, g) are shown to be sufficient for g=5.

Gennian Ge | K. Chen | L. Zhu

[1] Ronald C. Mullin,et al. A Generalization of the Singular Direct Product with Applications Skew Room Squares , 1980, J. Comb. Theory, Ser. A.

[2] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[3] Frank E. Bennett,et al. Resolvable Mendelsohn triple systems with equal sized holes , 1997 .

[4] Tuvi Etzion,et al. Optimal constant weight codes over Zk and generalized designs , 1997, Discret. Math..

[5] Kevin T. Phelps,et al. Constant Weight Codes and Group Divisible Designs , 1999, Des. Codes Cryptogr..

[6] Kevin T. Phelps,et al. Generalized Steiner systems with block size three and group sizeg ? 3(mod 6) , 1997 .