By Topic

Combinatorial constructions of optimal optical orthogonal codes with weight 4

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yanxun Chang ; Dept. of Math., Northern Jiaotong Univ., Beijing, China ; Fuji-Hara, R. ; Ying Miao

A (v,k,λ) optical orthogonal code C is a family of (0,1) sequences of length v and weight k satisfying the following correlation properties: 1) Σ0≤t≤v-1xtxt+i≤λ for any x=(x0, x1, ..., xv-1)∈C and any integer i≠0(mod v); 2) Σ0≤t≤v-1xtyt+i≤λ for any x=(x0, x1, ..., xv-1)∈C, y=(y0, y1, ..., yv-1)∈C with x≠y, and any integer i, where the subscripts are taken modulo v. A (v,k,λ) optical orthogonal code (OOC) with (1/k)(v-1/k-2)(v-2/k-2)···(v-λ/k-λ)$: M 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≡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≡0 (mod 24).

Published in:

Information Theory, IEEE Transactions on  (Volume:49 ,  Issue: 5 )