Optimum sequence multisets for synchronous code-division multiple-access channels

It is shown that the sum capacity of the symbol-synchronous code-division multiple-access channel with equal average-input-energy constraints is maximized precisely by those spreading sequence multisets that meet Welch´s lower bound on total squared correlation. It is further shown that the symmetric capacity of the channel determined by these same sequence multisets is equal to the sum capacity