Combinatorial constructions of optimal optical orthogonal codes with weight 4

A (v,k,(lambda)) optical orthogonal code C is a family of (0,1) sequences of length v and weight k satisfying the following correlation properties: 1) (sigma)/sub 0<=t<=v-1/x/sub t/x/sub t+i/<=(lambda) for any x=(x/sub 0/, x/sub 1/, ..., x/sub v-1/)(isin)C and any integer i(not idential with)0(mod v); 2) (sigma)/sub 0<=t<=v1/x/sub t/y/sub t+i/<=(lambda) for any x=(x/sub 0/, x/sub 1/, ..., x/sub v-1/)(isin)C, y=(y/sub 0/, y/sub 1/, ..., y/sub v-1/)(isin)C with x(not equal to)y, and any integer i, where the subscripts are taken modulo v. A (v,k,(lambda)) optical orthogonal code (OOC) with (...)(1/k)(...)(v-1/k-2)(...)(v-2/k-2)(...)...(...)(v(lambda)/k-(lambda))(...)$: M(...)(...)(...) codewords is said to be optimal. OOCs are essential for success of fiber-optic code-division multipleaccess (CDMA) communication systems. The use of an optimal OOC enables the largest possible number of asynchronous users to transmit information efficiently and reliably. In this paper, various combinatorial constructions for optimal (v,4,1) OOCs, such as those via skew starters and Weilʹs theorem on character sums, are given for v(identical with)0 (mod 12). These improve the known existence results on optimal OOCs. In particular, it is shown that an optimal (v,4,1) OOC exists for any positive integer v(identical with)0 (mod 24).