Designs, Codes and Cryptography

, Volume 74, Issue 2, pp 365–377 | Cite as

Compression of periodic complementary sequences and applications

  • Dragomir Ž. Ɖoković
  • Ilias S. Kotsireas


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.


Supplementary difference sets Binary sequences Periodic autocorrelation Power spectral density  

Mathematics Subject Classification

05B20 05B30 



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.


  1. 1.
    Arasu K.T., Xiang Q.: On the existence of periodic complementary binary sequences. Des. Codes Cryptogr. 2, 257–262 (1992).Google Scholar
  2. 2.
    Baumert L.D.: Cyclic difference sets. In: Lecture Notes in Mathematics, vol. 182. Springer, Berlin (1971).Google Scholar
  3. 3.
    Cohn J.H.E.: A D-optimal design of order 102. Discret. Math. 102, 61–65 (1992).Google Scholar
  4. 4.
    Đoković D.Ž.: Note on periodic complementary sets of binary sequences. Des. Codes Cryptogr. 13, 251–256 (1998).Google Scholar
  5. 5.
    Đoković D.Ž.: Cyclic \((v;r, s;\lambda )\) difference families with two base blocks and \(v\le 50\). Ann. Comb. 15, 233–254 (2011).Google Scholar
  6. 6.
    Đoković D.Ž., Kotsireas I.S.: New results on D-optimal matrices. J. Comb. Des. 20, 278–289 (2012).Google Scholar
  7. 7.
    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).Google Scholar
  8. 8.
    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).Google Scholar
  9. 9.
    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).Google Scholar
  10. 10.
    Kotsireas I.S., Koukouvinos C.: Periodic complementary binary sequences of length 50. Int. J. Appl. Math. 21, 509–514 (2008).Google Scholar
  11. 11.
    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).Google Scholar
  12. 12.
    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).Google Scholar
  13. 13.
    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).Google Scholar
  14. 14.
    Ricker D.W.: Echo Signal Processing. The Springer International Series in Engineering and Computer Science, vol. 725. Springer, New York (2003).Google Scholar
  15. 15.
    Sawada J.: Generating bracelets in constant amortized time. SIAM J. Comput. 31, 259–268 (2001).Google Scholar
  16. 16.
    Sawada J.: A fast algorithm to generate necklaces with fixed content. Theor. Comput. Sci. 301(1–3), 477–489 (2003).Google Scholar
  17. 17.
    Stinson D.R.: Combinatorial Designs. Constructions and Analysis. Springer, New York (2004).Google Scholar
  18. 18.
    Vollrath A.: A modification of periodic Golay sequence pairs. Indiana University REU. (Summer 2008).
  19. 19.
    Yang C.H.: On Hadamard matrices constructible by circulant submatrices. Math. Comp. 25, 181–186 (1971).Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Department of Pure MathematicsUniversity of WaterlooWaterlooCanada
  2. 2.Department of Physics & Computer ScienceWilfrid Laurier UniversityWaterlooCanada

Personalised recommendations