Algorithm for construction of

A new algorithm for the construction of (0, 1)-code matrices based on the Greedy algorithm is proposed which allows the generation of code matrices with any desired matrix dimension and weight. Such codes are very useful in incoherent optical code-division multiple-access (CDMA) systems combining wavelength hopping and time spreading. So it is possible to achieve an auto-correlation function with zero sidelobes and an aperiodic cross-correlation function with a maximum value of one.