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. C © 2013 Wiley Periodicals, Inc. J. Combin. Designs 00: 1–20, 2013
منابع مشابه
Optical orthogonal codes: Their bounds and new optimal constructions
A (v, k, λa, λc) optical orthogonal code C is a family of (0, 1)-sequences of length v and weight k satisfying the following two correlation properties: (1) ∑ 0≤t≤v−1xtxt+i ≤ λa for any x = (x0, x1, . . . , xv−1) and any integer i 6≡ 0 mod v; and (2) ∑ 0≤t≤v−1xtyt+i ≤ λb for any x = (x0, x1, . . . , xv−1), y = (y0, y1, . . . , yv−1) with x 6= y, and any integer i, where subscripts are taken mod...
متن کاملCombinatorial constructions of optimal optical orthogonal codes with weight 4
A (v, k, λ) optical orthogonal code C is a family of (0, 1) sequences of length v and weight k satisfying the following two correlation properties: (1) ∑ 0≤t≤v−1xtxt+i ≤ λ for any x = (x0, x1, . . . , xv−1) ∈ C and any integer i 6≡ 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 6= y, and any integer i, where the subscripts are take...
متن کاملCombinatorial Constructions for Optical Orthogonal Codes
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 mo...
متن کامل3-Dimensional Optical Orthogonal Codes with Ideal Autocorrelation-Bounds and Optimal Constructions
Several new constructions of 3-dimensional optical orthogonal codes are presented here. In each case the codes have ideal autocorrelation λa = 0, and in all but one case a cross correlation of λc = 1. All codes produced are optimal with respect to the applicable Johnson bound either presented or developed here. Thus, on one hand the codes are as large as possible, and on the other, the bound(s)...
متن کاملConstructions for optimal optical orthogonal codes
In this paper two recursive constructions for optimal optical orthogonal codes are presented by means of incomplete di/erence matrices and perfect cyclic di/erence packings. These improve the known existence results concerning optimal (v; 4; 1)-OOCs. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013