A greedy algorithm for deriving optical orthogonal codes using rejected delays reuse

This paper proposes a novel algorithm for constructing Optical Orthogonal Codes (OOC). The proposed algorithm is a modified element-by-element greedy algorithm based on the extended set representation of Optical Orthogonal Codes. The algorithm employs a technique that reuses previously rejected delay elements during the construction process. We call this method the Rejected Delays Reuse (RDR) Greedy Algorithm. We show that employing the RDR method leads to code lengths that are significantly shorter than those achieved for OOCs constructed using the classical greedy algorithm for the same code weight and the same number of simultaneous codes constraints. To quantify the effect of the reduction in the code length on sub-wavelength multiplexing, we introduce a factor called the expansion efficiency factor and use it to show that the RDR generated codes have higher efficiency.