Compression of Periodic Complementary Sequences and Applications

Abstract

A collection of complex sequences of length v is complementary if the sum of their periodic autocorrelation function values at all non-zero shifts is constant. For a complex sequence A=[a_0,a_1,...,a_{v-1}] of length v=dm we define the m-compressed sequence A^{(d)} of length d whose terms are the sums a_i + a_{i+d} + ... + a_{i+(m-1)d}. We prove that the m-compression of a complementary collection of sequences is also complementary. The compression procedure can be used to simplify the construction of complementary {+1,-1}-sequences of composite length. In particular, we construct several supplementary difference sets (v;r,s;lambda) with v even and lambda=(r+s)-v/2, given here for the first time. There are 15 normalized parameter sets (v;r,s;lambda) with v <= 50 for which the existence question was open. We resolve all but one of these cases.

15 pages

Cited by in corpus (13)

• Applying Computer Algebra Systems with SAT Solvers to the Williamson Conjecture
• Some new periodic Golay pairs
• Symmetric Hadamard matrices of order 116 and 172 exist
• A feasibility approach for constructing combinatorial designs of circulant type
• D-optimal matrices of orders 118, 138, 150, 154 and 174
• Periodic Golay pairs of length 72
• Legendre pairs of lengths $\ell \equiv 0$ (mod $3$)
• Charm bracelets and their application to the construction of periodic Golay pairs
• New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences
• The SAT+CAS Method for Combinatorial Search with Applications to Best Matrices
• A New Form of Williamson's Product Theorem
• New Results on Periodic Golay Pairs
• New Nonexistence Results on Circulant Weighing Matrices