共查询到10条相似文献,搜索用时 37 毫秒
1.
We consider the existence problem for a semi‐cyclic holey group divisible design of type with block size 3, which is denoted by a 3‐SCHGDD of type . When t is odd and or t is doubly even and , the existence problem is completely solved; when t is singly even, many infinite families are obtained. Applications of our results to two‐dimensional balanced sampling plans and optimal two‐dimensional optical orthogonal codes are also discussed. 相似文献
2.
In this paper, we further investigate the constructions on three‐dimensional optical orthogonal codes with the at most one optical pulse per wavelength/time plane restriction (briefly AM‐OPP 3D ‐OOCs) by way of the corresponding designs. Several new auxiliary designs such as incomplete holey group divisible designs and incomplete group divisible packings are introduced and therefore new constructions are presented. As a consequence, the exact number of codewords of an optimal AM‐OPP 3D ‐OOC is finally determined for any positive integers and . 相似文献
3.
Marco Buratti 《Designs, Codes and Cryptography》2002,26(1-3):111-125
We prove the existence of a cyclic (4p, 4, 1)-BIBD—and hence, equivalently, that of a cyclic (4, 1)-GDD of type 4
p
—for any prime
such that (p–1)/6 has a prime factor q not greater than 19. This was known only for q=2, i.e., for
. In this case an explicit construction was given for
. Here, such an explicit construction is also realized for
.We also give a strong indication about the existence of a cyclic (4p 4, 1)-BIBD for any prime
, p>7. The existence is guaranteed for p>(2q
3–3q
2+1)2+3q
2 where q is the least prime factor of (p–1)/6.Finally, we prove, giving explicit constructions, the existence of a cyclic (4, 1)-GDD of type 6
p
for any prime p>5 and the existence of a cyclic (4, 1)-GDD of type 8
p
for any prime
. The result on GDD's with group size 6 was already known but our proof is new and very easy.All the above results may be translated in terms of optimal optical orthogonal codes of weight four with =1. 相似文献
4.
In this paper, we are concerned about optimal (v, 4, 3, 2)‐OOCs. A tight upper bound on the exact number of codewords of optimal (v, 4, 3, 2)‐OOCs and some direct and recursive constructions of optimal (v, 4, 3, 2)‐OOCs are given. As a result, the exact number of codewords of an optimal (v, 4, 3, 2)‐OOC is determined for some infinite series. 相似文献
5.
We determine a necessary and sufficient condition for the existence of semicyclic holey group divisible designs with block size three and group type . New recursive constructions on semicyclic incomplete holey group divisible designs are introduced to settle this problem completely. 相似文献
6.
Yun Qing Xu 《数学学报(英文版)》2009,25(8):1325-1336
A Latin squares of order v with ni missing sub-Latin squares (holes) of order hi (1 〈= i 〈 k), which are disjoint and spanning (i.e. ∑k i=l1 nihi = v), is called a partitioned incomplete Latin squares and denoted by PILS. The type of PILS is defined by (h1n1 h2n2…hknk ). If any two PILS inaset of t PILS of type T are orthogonal, then we denote the set by t-HMOLS(T). It has been proved that 3-HMOLS(2n31) exist for n ≥6 with 11 possible exceptions. In this paper, we investigate the existence of 3-HMOLS(2nu1) with u ≥ 4, and prove that 3-HMOLS(2~u1) exist if n ≥ 54 and n ≥7/4u + 7. 相似文献
7.
Li-dong Wang Hai-rong Kong Hong-juan Liu Department of Basic Courses Chinese People’s Armed Police Force Academy Langfang China School of Science Hebei University of Technology Tianjin China Department of Computer Science Engineering Langfang Polytechnic Institute China 《应用数学学报(英文版)》2011,27(3):407-418
In this paper, we investigate the existence of incomplete group divisible designs (IGDDs) with block size four, group-type (g, h) u and general index λ. The necessary conditions for the existence of such a design are that u ≥ 4, g ≥ 3h, λg(u 1) ≡ 0 (mod 3), λ(g h)(u 1) ≡ 0 (mod 3), and λu(u 1)(g 2 h 2 ) ≡ 0 (mod 12). These necessary conditions are shown to be sufficient for all λ≥ 2. The known existence result for λ = 1 is also improved. 相似文献
8.
Large sets of disjoint group‐divisible designs with block size three and type 2n41 have been studied by Schellenberg, Chen, Lindner and Stinson. These large sets have applications in cryptography in the construction of perfect threshold schemes. It is known that such large sets can exist only for n ≡ 0 (mod 3) and do exist for n = 6 and for all n = 3k, k ≥ 1. In this paper, we present new recursive constructions and use them to show that such large sets exist for all odd n ≡ 0 (mod 3) and for even n = 24m, where m odd ≥ 1. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 285–296, 2001 相似文献
9.
Variable‐weight optical orthogonal code (OOC) was introduced by G‐C Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirement. In this article, new infinite classes of optimal (u, W, 1, {1/2, 1/2})‐OOCs are obtained for W={3, 4}, {3, 5} and {3, 6}. © 2010 Wiley Periodicals, Inc. J Combin Designs 18: 274–291, 2010 相似文献
10.
An is a triple , where X is a set of points, is a partition of X into m disjoint sets of size n and is a set of 4‐element transverses of , such that each 3‐element transverse of is contained in exactly one of them. If the full automorphism group of an admits an automorphism α consisting of n cycles of length m (resp. m cycles of length n), then this is called m‐cyclic (resp. semi‐cyclic). Further, if all block‐orbits of an m‐cyclic (resp. semi‐cyclic) are full, then it is called strictly cyclic. In this paper, we construct some infinite classes of strictly m‐cyclic and semi‐cyclic , and use them to give new infinite classes of perfect two‐dimensional optical orthogonal codes with maximum collision parameter and AM‐OPPTS/AM‐OPPW property. 相似文献