Skip to Main Content
Optical orthogonal codes (OOCs) are commonly used as signature codes for optical code-division multiple-access (OCDMA) communication systems. Many OOCs have been proposed and investigated. Asynchronous OCDMA systems using conventional OOCs have a very limited number of subscribers and few simultaneous users. Recently, we reported a new code family with large code size by relaxing the crosscorrelation constraint to 2. In this paper, by further loosening the crosscorrelation constraint, we adopt the random greedy algorithm to construct a code family which has larger code size and more simultaneous users. We also derive an upper bound of the number of simultaneous users for a given code length, code weight, and bit error rate. The study shows that it is possible to have codes approaching this bound.
Date of Publication: March 2003