## 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,
Some combinatorial constructions for optical orthogonal codes
β Scribed by Jianxing Yin
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 942 KB
- Volume
- 185
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
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 i. The study of optical orthogonal codes is motivated by an application in a code-division multiple-access fiber optical channel which requires binary sequences with good correlation properties. In this paper, some combinatorial constructions for optimal (v, k, 1) optical orthogonal codes are developed. The constructions are also used to derive a bulk of new optical orthogonal codes.
π SIMILAR VOLUMES
## 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
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, n