In this paper we propose a solution to find the maximal simultaneous users code set by genetic algorithm. By this methodology, the code set can be exactly selected which is error free. Besides, the computing time for this methodology is much faster than the heuristic solution as the prime number P is larger than 5.
Computational Electromagnetics and Its Applications, 1999. Proceedings. (ICCEA '99) 1999 International Conference on, pp.129-132