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,\ldots ,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} + \cdots + 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 \(\{\pm 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\le 50\) for which the existence question was open. We resolve all but one of these cases.
Similar content being viewed by others
References
Arasu K.T., Xiang Q.: On the existence of periodic complementary binary sequences. Des. Codes Cryptogr. 2, 257–262 (1992).
Baumert L.D.: Cyclic difference sets. In: Lecture Notes in Mathematics, vol. 182. Springer, Berlin (1971).
Cohn J.H.E.: A D-optimal design of order 102. Discret. Math. 102, 61–65 (1992).
Đoković D.Ž.: Note on periodic complementary sets of binary sequences. Des. Codes Cryptogr. 13, 251–256 (1998).
Đoković D.Ž.: Cyclic \((v;r, s;\lambda )\) difference families with two base blocks and \(v\le 50\). Ann. Comb. 15, 233–254 (2011).
Đoković D.Ž., Kotsireas I.S.: New results on D-optimal matrices. J. Comb. Des. 20, 278–289 (2012).
Fletcher R.J., Gysin M., Seberry J.: Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices. Australas. J. Comb. 23, 75–86 (2001).
Jungnickel D., Pott A., Smith K.W.: Difference sets. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn. Discrete Mathematics and Its Applications, pp. 419–435. Chapman & Hall/CRC, Boca Raton (2007).
Kharaghani, H., Orrick, W.: D-optimal matrices. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn. Discrete Mathematics and Its Applications, pp. 296–298. Chapman & Hall/CRC, Boca Raton (2007).
Kotsireas I.S., Koukouvinos C.: Periodic complementary binary sequences of length 50. Int. J. Appl. Math. 21, 509–514 (2008).
Kounias S., Koukouvinos C., Nikolaou N., Kakos A.: The nonequivalent circulant D-optimal designs for \(n \equiv 2 \, {\rm mod} \;4, n \le 54, n=66\). J. Comb. Theory A 65, 26–38 (1994).
Martínez L., Đoković D.Ž., Vera-López A.: Existence question for difference families and construction of some new families. J. Comb. Des. 12, 256–270 (2004).
Mathon R., Rosa A.: 2-\((v, k,\lambda )\) Designs of small order. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn. Discrete Mathematics and Its Applications, pp. 25–58. Chapman & Hall/CRC, Boca Raton (2007).
Ricker D.W.: Echo Signal Processing. The Springer International Series in Engineering and Computer Science, vol. 725. Springer, New York (2003).
Sawada J.: Generating bracelets in constant amortized time. SIAM J. Comput. 31, 259–268 (2001).
Sawada J.: A fast algorithm to generate necklaces with fixed content. Theor. Comput. Sci. 301(1–3), 477–489 (2003).
Stinson D.R.: Combinatorial Designs. Constructions and Analysis. Springer, New York (2004).
Vollrath A.: A modification of periodic Golay sequence pairs. Indiana University REU. http://mypage.iu.edu/~worrick/reubook08-1.pdf (Summer 2008).
Yang C.H.: On Hadamard matrices constructible by circulant submatrices. Math. Comp. 25, 181–186 (1971).
Acknowledgments
The authors thank Joe Sawada and Daniel Recoskie for sharing improved versions of their C code for computing ordinary and charmed bracelets. We also thank William Orrick for providing reference [18]. The authors wish to acknowledge generous support by NSERC. This work was made possible by the facilities of the Shared Hierarchical Academic Research Computing Network (SHARCNET) and Compute/Calcul Canada.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by J. Jedwab.
Rights and permissions
About this article
Cite this article
Ɖoković, D.Ž., Kotsireas, I.S. Compression of periodic complementary sequences and applications. Des. Codes Cryptogr. 74, 365–377 (2015). https://doi.org/10.1007/s10623-013-9862-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-013-9862-z