期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Generalized Steiner Triple Systems with Group Size Ten
1
作者 葛根年 吴佃华 《Journal of Mathematical Research and Exposition》 CSCD 北大核心 2003年第3期391-396,共6页
Generalized Steiner triple systems, GS(2, 3, n, g) are equivalent to (g+1)-ary maximum constant weight codes (n, 3,3)s. In this paper, it is proved that the necessary conditions for the existence of a GS(2,3, n, 10), ... Generalized Steiner triple systems, GS(2, 3, n, g) are equivalent to (g+1)-ary maximum constant weight codes (n, 3,3)s. In this paper, it is proved that the necessary conditions for the existence of a GS(2,3, n, 10), namely, n ≡ 0,1 (mod 3) and n ≥ 12, are also sufficient. 展开更多
关键词 generalized steiner triple system constant weight codes holey generalized steiner triple system singular indirect product.
下载PDF
Indecomposable Large Sets of Steiner Triple Systems with Indices 5, 6
2
作者 Mei Hui CHENG Zi Hong TIAN 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2012年第11期2169-2184,共16页
A family (X, B1),(X, B2),..., (X, Bq) of q STS(v)s is a λ-fold large set of STS(v) and denoted by LSTSλ(v) if every 3-subset of X is contained in exactly A STS(v)s of the collection. It is indecomposab... A family (X, B1),(X, B2),..., (X, Bq) of q STS(v)s is a λ-fold large set of STS(v) and denoted by LSTSλ(v) if every 3-subset of X is contained in exactly A STS(v)s of the collection. It is indecomposable and denoted by IDLSTSx(v) if there does not exist an LSTSx, (v) contained in the collection for any λ 〈 λ. In this paper, we show that for λ = 5, 6, there is an IDLSTSλ(v) for v ≡ 1 or 3 (rood 6) with the exception IDLSTS6(7). 展开更多
关键词 steiner triple system large set candelabra system INDECOMPOSABLE
原文传递
Generalized Steiner Triple Systems with Group Size g ≡0, 3 (mod 6)
3
作者 Gen-nian GeDepartment of Mathematics, Suzhou University, Suzhou 215006, China 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2002年第4期561-568,共8页
Generalized Steirier triple 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. The necessary conditions... Generalized Steirier triple 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. The necessary conditions for the existence of a GS(2,3,n,g) are (n-1)g≡0 (mod 2), n(n-1)g2≡0 (mod 6), and n≥g+2. These necessary conditions are shown to be sufficient by several authors for 2≤g≤11. In this paper, three new results are obtained. First, it is shown that for any given g, g≡0 (mod 6) and g≥12, if there exists a GS(2.3.n.g) for all n, g+2≤n≤7g+13. then the necessary conditions are also sufficient. Next, it is also shown that for any given g, g≡3 (mod 6) and g≥15, if there exists a GS(2,3,n,g) for all n, n≡1 (mod 2) and g+2≤n≤7g+6, then the necessary conditions are also sufficient. Finally, as an application, it is proved that the necessary conditions for the existence of a GS(2,3,n,g) are also sufficient for g=12,15. 展开更多
关键词 Generalized steiner triple system constant weight codes singular indirect product DISJOINT
全文增补中
上一页 1 下一页 到第
使用帮助 返回顶部