𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Semi-randomly constructed optical orthogonal codes

✍ Scribed by Cenk Argon

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
239 KB
Volume
282
Category
Article
ISSN
0030-4018

No coin nor oath required. For personal study only.

✦ Synopsis

Optical orthogonal code (OOC) sequences are assigned to optical code-division multiple-access (OCDMA) network users, who are able to transmit data asynchronously. In this work, we propose a semi-random OOC design technique based on extended sets, where the input parameters are the sequence weight, number of sequences (i.e., users), and a target sequence length. The design method under consideration is able to converge to the desired short OOC lengths given the number of iterations during the execution of the algorithm is sufficiently large.

πŸ“œ SIMILAR VOLUMES

Some combinatorial constructions for opt
Some combinatorial constructions for optical orthogonal codes
✍ Jianxing Yin πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 942 KB

A (v,k,p) optical orthogonal code ~ is a family of (0,1)-sequences of length v and weight k satisfying the following two properties: (1)~o<.,<.v\_lXtX,+i<~p, for any x = (Xo, x ~ ..... x ~\_ ~ ) e ~ and any integer i ~ 0 (rood v); (2) 5~ o ~, .< ~-~ x~ y, + ~ ~< p, for any x ~ y in ~ and any integer

Constructions of optimal variable-weight
Constructions of optimal variable-weight optical orthogonal codes
✍ Hengming Zhao; Dianhua Wu; Pingzhi Fan πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 165 KB

## Abstract 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,

Constructions of optimal optical orthogo
Constructions of optimal optical orthogonal codes with weight five
✍ Shikui Ma; Yanxun Chang πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 137 KB

## Abstract 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 imp

Optimal (4up, 5, 1) optical orthogonal c
Optimal (4up, 5, 1) optical orthogonal codes
✍ Yanxun Chang; L. Ji πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 153 KB

## Abstract By a (__Ξ½__, __k__, 1)‐OOC we mean an optical orthogonal code. In this paper, it is proved that an optimal (4__p__, 5, 1)‐OOC exists for prime __p__ ≑ 1 (mod 10), and that an optimal (4__up__, 5, 1)‐OOC exists for __u__ = 2, 3 and prime __p__ ≑ 11 (mod 20). These results are obtained by