Abstract

The 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 bound.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.