Minimum total-squared-correlation design of DS-CDMA binary signature setsMinimum total-squared-correlation design of DS-CDMA binary signature sets Πλήρης Δημοσίευση σε Συνέδριο Conference Full Paper 2015-11-102001enThe Welch lower bound (see Welch, L.R., IEEE Trans. Inform. Theory, vol.20, p.397-9, 1974; Massey, J. L. and Mittelholzer, T., "Sequences II, Methods in Communication, Security, and Computer Sciences", p.63-78, Springer-Verlag, New York, 1993) on the total-squared-correlation (TSC) of signature sets is known to be tight for real-valued signatures and loose for binary signatures whose number is not a multiple of 4. We derive new bounds on the TSC of binary signature sets for any number of signatures K and any signature length L. For almost all K, L in {1, 2, ..., 200}, we develop simple algorithms for the design of optimum binary signature sets that achieve the new boundhttp://creativecommons.org/licenses/by-nc-nd/4.0/801 - 805Communication Theory SymposiumProc. IEEE , Communication Theory Symposium Karystinos Georgios Καρυστινος Γεωργιος Pados Dimitrios A. Institute of Electrical and Electronics Engineers