Abstract
A (v,k,/spl lambda/) optical orthogonal code C is a family of (0,1) sequences of length v and weight k satisfying the following correlation properties: 1) /spl Sigma//sub 0/spl les/t/spl les/v-1/x/sub t/x/sub t+i//spl les//spl lambda/ for any x=(x/sub 0/, x/sub 1/, ..., x/sub v-1/)/spl isin/C and any integer i/spl ne/0(mod v); 2) /spl Sigma//sub 0/spl les/t/spl les/v-1/x/sub t/y/sub t+i//spl les//spl lambda/ for any x=(x/sub 0/, x/sub 1/, ..., x/sub v-1/)/spl isin/C, y=(y/sub 0/, y/sub 1/, ..., y/sub v-1/)/spl isin/C with x/spl ne/y, and any integer i, where the subscripts are taken modulo v. A (v,k,/spl lambda/) optical orthogonal code (OOC) with /spl lfloor/(1/k)/spl lfloor/(v-1/k-2)/spl lfloor/(v-2/k-2)/spl lfloor//spl middot//spl middot//spl middot//spl lfloor/(v-/spl lambda//k-/spl lambda/)/spl rfloor/$: M/spl rfloor//spl rfloor//spl rfloor/ codewords is said to be optimal. OOCs are essential for success of fiber-optic code-division multiple-access (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/spl equiv/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/spl equiv/0 (mod 24).
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call