A Generalization of the Symmetric Capacity of Optimal Sequences for Quasi-scalable Systems

We extend a recent result on the symmetric capacity of multiple-OCDMA (m-O) signature sets, which are known to maximize the sum capacity under the constraint of quasi-scalability. Whereas it was found recently that the symmetric capacity equals the sum capacity for randomly scrambled m-O sequence sets (which are only defined for spreading factors that are a power of two), we extend this result to any m-O system. As a consequence, the maximum achievable sum capacity equals the maximum achievable symmetric capacity under the constraint of quasi-scalability for any spreading factor, and any type of m-O signature set maximizes both the sum capacity and the symmetric capacity among all quasi-scalable systems