Optimal (4up, 5, 1) optical orthogonal codes

By a (ν, k, 1)‐OOC we mean an optical orthogonal code. In this paper, it is proved that an optimal (4p, 5, 1)‐OOC exists for prime p ≡ 1 (mod 10), and that an optimal (4up, 5, 1)‐OOC exists for u = 2, 3 and prime p ≡ 11 (mod 20). These results are obtained by applying Weil's theorem. © 2004 Wiley Periodicals, Inc.     

最优(v,{3,4},1,Q)-光正交码的构造

在光纤码分多址(OCDMA)系统中,变重量光正交码被广泛使用,以满足多种服务质量的需求.利用分圆类和斜starter给出了直接构造方法,借助有关循环差阵的递归构造方法,从而构造了两类循环填充设计.通过建立循环填充设计与变重量光正交码之间的联系,证明了当Q∈{{2/3,1/3},{3/4,1/4}}时,最优(v,{3,4},1,Q)-光正交码存在的无穷类.     

Constructions of optimal variable‐weight optical orthogonal codes

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     

2-dimensional optical orthogonal codes from singer groups

We present several new families of (Λ×T,w,λ) (2D) wavelength/time optical orthogonal codes (2D-OOCs) with λ=1,2. All families presented are either optimal with respect to the Johnson bound (J-optimal) or are asymptotically optimal. The codes presented have more flexible dimensions and weight than the J-optimal families appearing in the literature. The constructions are based on certain pointsets in finite projective spaces of dimension k over GF(q) denoted PG(k,q). This finite geometries framework gives structure to the codes providing insight. We establish that all 2D-OOCs constructed are in fact maximal (in that no new codeword may be added to the original whereby code cardinality is increased).     

Bounds and Constructions on (v, 4, 3, 2) Optical Orthogonal Codes

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.     

Constructions of optimal optical orthogonal codes with weight five

Several direct constructions via skew starters and Weil's theorem on character sum estimates are given in this paper for optimal (gv, 5, 1) optical orthogonal codes (OOCs) where 60 ≤ g ≤ 180 satisfying g ≡ 0 (mod 20) and v is a product of primes greater than 5. These improve the known existence results on optimal OOCs. Especially, we provide an optimal (v, 5, 1)‐OOC for any integer v ≡ 60, 420, 660, 780, 1020, 1140, 1380, 1740 (mod 1800). © 2004 Wiley Periodicals, Inc. J Combin Designs 13: 54–69, 2005.     

最优(24u,{3,4},1,{2/3,1/3})光正交码

Variable-weight optical orthogonal codes(OOCs) were introduced by G. C. YANG for multimedia optical CDMA systems with multiple quality of service(Qo S) requirements. In this paper, some infinite classes of optimal cyclic packing are presented. Optimal(24u, {3, 4}, 1,{2/3, 1/3})-OOCs for any positive integer u > 1 are established.     

On optimal (v, 5, 2, 1) optical orthogonal codes

The size of a (v, 5, 2, 1) optical orthogonal code (OOC) is shown to be at most equal to ${\lceil{\frac{v}{12}}\rceil}$ when v ≡ 11 (mod 132) or v ≡ 154 (mod 924), and at most equal to ${\lfloor{\frac{v}{12}}\rfloor}$ in all the other cases. Thus a (v, 5, 2, 1)-OOC is naturally said to be optimal when its size reaches the above bound. Many direct and recursive constructions for infinite classes of optimal (v, 5, 2, 1)-OOCs are presented giving, in particular, a very strong indication about the existence of an optimal (p, 5, 2, 1)-OOC for every prime p ≡ 1 (mod 12).     

Cyclic Designs with Block Size 4 and Related Optimal Optical Orthogonal Codes

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 ³–3q ²+1)²+3q ² 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.     

Maximum w-cyclic holey group divisible packings and their application to three-dimensional optical orthogonal codes

Motivated by the application to three-dimensional optical orthogonal codes, we consider the construction for a w-cyclic holey group divisible packing of type $(u,w^v)$ with block size three (3-HGDP for short). A maximum w-cyclic 3-HGDP of type $(u,w^v)$ contains the largest possible number of base blocks. When $u\equiv 0,1(\mathrm{mod}3)$, the exact size of maximum w-cyclic 3-HGDP of type $(u,w^v)$ has been determined in our previous work. Based on recursive constructions, in this paper we establish a framework to construct maximum w-cyclic 3-HGDPs of type $(u,w^v)$ where $u\equiv 2$ (mod 3). In the process, direct constructions on several key auxiliary designs are displayed by choosing appropriate automorphism groups. Eventually, the sizes of maximum w-cyclic 3-HGDPs of type $(u,w^v)$ are determined for all positive integers $u,v$ and w, only leaving a small fraction of possible exceptions unresolved. Furthermore, application of our results to three-dimensional optical orthogonal codes is presented.     

The Existence of （v, 4, 1） Disjoint Difference Families with v a Prime Power

A （v, k, λ） difference family （（v, k, λ）-DF in short） over an abelian group G of order v, is a collection F=（Bi｜i ∈ I} of k-subsets of G, called base blocks, such that any nonzero element of G can be represented in precisely A ways as a difference of two elements lying in some base blocks in F. A （v, k, λ）-DDF is a difference family with disjoint blocks. In this paper, by using Weil＇s theorem on character sum estimates, it is proved that there exists a （p^n, 4, 1）-DDF, where p = 1 （rood 12） is a prime number and n ≥1.     

Constructions for optimal (u×v,{3,4},1,Q)-OOSPCs

Multiple-weight optical orthogonal signature pattern codes (OOSPCs) were introduced by Kwong and Yang for 2-D image transmission in multicore-fiber optical code-division multiple-access (OCDMA) networks with multiple quality of services (QoS) requirement. In this paper, an upper bound on the maximum code size of a $(u\times v,W,\lambda ,Q)$-OOSPC is obtained. A link between optimal $(u\times v,W,\lambda ,Q)$-OOSPCs and block designs is developed. Several infinite families of optimal $(u\times v,\{3,4\},1,Q)$-OOSPCs are presented by means of semi-cyclic group divisible designs ($(W,Q)$-SCGDDs) and perfect relative difference families.     

Optimal Two‐Dimensional Optical Orthogonal Codes with the Best Cross‐Correlation Constraint

The study of optical orthogonal codes has been motivated by an application in an optical code‐division multiple access system. From a practical point of view, compared to one‐dimensional optical orthogonal codes, two‐dimensional optical orthogonal codes tend to require smaller code length. On the other hand, in some circumstances only with good cross‐correlation one can deal with both synchronization and user identification. These motivate the study of two‐dimensional optical orthogonal codes with better cross‐correlation than auto‐correlation. This paper focuses on optimal two‐dimensional optical orthogonal codes with the auto‐correlation and the best cross‐correlation 1. By examining the structures of w‐cyclic group divisible designs and semi‐cyclic incomplete holey group divisible designs, we present new combinatorial constructions for two‐dimensional ‐optical orthogonal codes. When and , the exact number of codewords of an optimal two‐dimensional ‐optical orthogonal code is determined for any positive integers n and .     

Extremal Self-Dual [50, 25, 10] Codes with Automorphisms of Order 3 and Quasi-Symmetric 2-(49, 9,6) Designs

Five non-isomorphic quasi-symmetric 2-(49, 9, 6) designs are known. They arise from extremal self-dual [50, 25, 10] codes with a certain weight enumerator. Four of them have an automorphism of order 3 fixing two points. In this paper, it is shown that there are exactly 48 inequivalent extremal self-dual [50, 25, 10] code with this weight enumerator and an automorphism of order 3 fixing two points. 44 new quasi-symmetric 2-(49, 9, 6) designs with an automorphism of order 3 are constructed from these codes.     

^2F4（q2）与2-（v，k，3）对称设计

本文要证明不存在一个非平凡2-（v，k，3）对称设计，它的旗传递自同构群的基柱是^2F4（q2）     

Optimal holey packings OHP4(2, 4, n ,3)'s

An optimal holey packing OHP_d(2, k, n, g) is equivalent to a maximal (g + 1)‐ary (n, k, d) constant weight code. In this paper, we provide some recursive constructions for OHP_d(2, k, n, g)'s and use them to investigate the existence of an OHP₄(2, 4, n, 3) for n ≡ 2, 3 (mod 4). Combining this with Wu's result ( 18 ), we prove that the necessary condition for the existence of an OHP₄(2, 4, n, 3), namely, n ≥ 5 is also sufficient, except for n ∈ {6, 7} and except possibly for n = 26. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 111–123, 2006     

Existence of T*(3, 4,v)‐codes

A word of length k over an alphabet Q of size v is a vector of length k with coordinates taken from Q. Let Q^*₄ be the set of all words of length 4 over Q. A T^*(3, 4, v)‐code over Q is a subset C^*? Q^*₄ such that every word of length 3 over Q occurs as a subword in exactly one word of C^*. Levenshtein has proved that a T^*(3, 4, vv)‐code exists for all even v. In this paper, the notion of a generalized candelabra t‐system is introduced and used to show that a T^*(3, 4, v)‐code exists for all odd v. Combining this with Levenshtein's result, the existence problem for a T^*(3,4, v)‐code is solved completely. © 2004 Wiley Periodicals, Inc. J Combin Designs 13: 42–53, 2005.     

Optimal Systems and Group Classification of (1+2)-Dimensional Heat Equation

The optimal systems and symmetry breaking interactions for the (1+2)-dimensional heat equation are systematically studied. The equation is invariant under the nine-dimensional symmetry group H ₂. The details of the construction for an one-dimensional optimal system is presented. The optimality of one- and two-dimensional systems is established by finding some algebraic invariants under the adjoint actions of the group H ₂. A list of representatives of all Lie subalgebras of the Lie algebra h ₂ of the Lie group H ₂ is given in the form of tables and many of their properties are established. We derive the most general interactions F(t,x,y,u,u _x ,u _y ) such that the equation u _t =u _xx +u _yy +F(t,x,y,u,u _x ,u _y ) is invariant under each subgroup.     

Optimal cyclic (r,δ) locally repairable codes with unbounded length

Locally repairable codes with locality r (r-LRCs for short) were introduced by Gopalan et al. [1] to recover a failed node of the code from at most other r available nodes. And then $(r,\delta )$-locally repairable codes ($(r,\delta )$-LRCs for short) were produced by Prakash et al. [2] for tolerating multiple failed nodes. An r-LRC can be viewed as an $(r,2)$-LRC. An $(r,\delta )$-LRC is called optimal if it achieves the Singleton-type bound. It has been a great challenge to construct q-ary optimal $(r,\delta )$-LRCs with length much larger than q. Surprisingly, Luo et al. [3] presented a construction of q-ary optimal r-LRCs of minimum distances 3 and 4 with unbounded lengths (i.e., lengths of these codes are independent of q) via cyclic codes.In this paper, inspired by the work of [3], we firstly construct two classes of optimal cyclic $(r,\delta )$-LRCs with unbounded lengths and minimum distances $\delta +1$ or $\delta +2$, which generalize the results about the $\delta =2$ case given in [3]. Secondly, with a slightly stronger condition, we present a construction of optimal cyclic $(r,\delta )$-LRCs with unbounded length and larger minimum distance 2δ. Furthermore, when $\delta =3$, we give another class of optimal cyclic $(r,3)$-LRCs with unbounded length and minimum distance 6.     

Determination of Sizes of Optimal Three‐Dimensional Optical Orthogonal Codes of Weight Three with the AM‐OPP Restriction

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 .