๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new recursive construction for optical orthogonal codes

โœ Scribed by Wensong Chu; Golomb, S.W.

Book ID
114637338
Publisher
IEEE
Year
2003
Tongue
English
Weight
317 KB
Volume
49
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

๐Ÿ“œ 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

Semi-randomly constructed optical orthog
Semi-randomly constructed optical orthogonal codes
โœ Cenk Argon ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 239 KB

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