Gallager codes for multiple user applications

We study the performance limits of a multiple access system based on the Gallager codes. We show that we can bypass the spreading sequences in a multiple access system. The algebraic orthogonality is replaced by a statistical orthogonality provided by the randomness of the Gallager codes. The performance of our system are close to the optimum achievable bound.