On the Karystinos-Pados bounds and optimal binary DS-CDMA signature ensembles

Tightness of the Karystinos-Pados bounds was originally proved with four exceptions. In this letter, we modify the algorithm of constructing signatures removing three of these exceptions. For the fourth one the tighter bounds are derived.