Skip to main content

Generalised Complementary Arrays

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 7089))

Abstract

We present a generalised setting for the construction of complementary array pairs and its proof, using a unitary matrix notation. When the unitaries comprise multivariate polynomials in complex space, we show that four definitions of conjugation imply four types of complementary pair - types I, II, III, and IV. We provide a construction for complementary pairs of types I, II, and III over {1, − 1}, and further specialize to a construction for all known 2 ×2 ×…×2 complementary array pairs of types I, II, and III over {1, − 1}. We present a construction for type-IV complementary array pairs, and call them Rayleigh quotient pairs. We then generalise to complementary array sets, provide a construction for complementary sets of types I, II, and III over {1, − 1}, further specialize to a construction for all known 2 ×2 ×…×2 complementary array sets of types I, II, and III over {1, − 1}, and derive closed-form Boolean formulas for these cases.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Golay, M.J.E.: Multislit spectroscopy. J. Opt. Soc. Amer. 39, 437–444 (1949)

    Article  Google Scholar 

  2. Golay, M.J.E.: Static multislit spectrometry and its application to the panoramic display of infrared spectra. J. Opt. Soc. Amer. 41, 468–472 (1951)

    Article  Google Scholar 

  3. Golay, M.J.E.: Complementary series. IRE Trans. Inform. Theory IT-7, 82–87 (1961)

    Article  MathSciNet  Google Scholar 

  4. Shapiro, H.S.: Extremal problems for polynomials and power series. Master’s thesis, Mass. Inst. of Technology (1951)

    Google Scholar 

  5. Turyn, R.J.: Hadamard matrices, Baumert-Hall units, four-symbol sequences, pulse compression, and surface wave encodings. J. Combin. Theory (A) 16, 313–333 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  6. Davis, J.A., Jedwab, J.: Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes. IEEE Trans. Inform. Theory 45, 2397–2417 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Tseng, C.C., Liu, C.L.: Complementary sets of sequences. IEEE Trans. Inform. Theory 18(5), 644–652 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  8. Lüke, H.D.: Sets of one and higher dimensional Welti codes and complementary codes. IEEE Trans. Aerospace Electron. Systems AES-21, 170–179 (1985)

    Article  MathSciNet  Google Scholar 

  9. Parker, M.G., Tellambura, C.: A Construction for Binary Sequence Sets with Low Peak-to-Average Power Ratio. Reports in Informatics 242, 333–3590 (2003); ISSN 0333–3590

    Google Scholar 

  10. Schmidt, K.-U.: Complementary Sets, Generalized Reed-Muller Codes, and Power Control for OFDM. IEEE Trans. Inform. Theory 53(2), 808–814 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  11. Chong, C.V., Venkataramani, R., Tarokh, V.: A new construction of 16-QAM Golay complementary sequences. IEEE Trans. Inform. Theory 49, 2953–2959 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Craigen, R., Koukouvinos, C.: A theory of ternary complementary pairs. J. Combin. Theory (Series A) 96, 358–375 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  13. Craigen, R., Holzmann, W., Kharaghani, H.: Complex Golay sequences: structure and applications. Discrete Math. 252, 73–89 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  14. Dymond, M.: Barker arrays: existence, generalization and alternatives. PhD thesis, University of London (1992)

    Google Scholar 

  15. Parker, M.G., Tellambura, C.: Generalised Rudin-Shapiro Constructions. In: Augot, D., Carlet, C. (eds.) WCC 2001 International Workshop on Coding and Cryptography, Electronic Notes in Discrete Mathematics, Paris, France, January 8–12, April 6 (2001)

    Google Scholar 

  16. Parker, M.G., Tellambura, C.: A Construction for Binary Sequence Sets with Low Peak-to-Average Power Ratio. In: Int. Symp. Inform. Theory, Lausanne, Switzerland, June 30–July 5, vol. 239 (2002)

    Google Scholar 

  17. Borwein, P.B., Ferguson, R.A.: A Complete Description of Golay Pairs for Lengths up to 100. Math. Comp. 73(246), 967–985 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  18. Matsufuji, S., Shigemitsu, R., Tanada, Y., Kuroyanagi, N.: Construction of Complementary Arrays. In: Proc. of Sympotic 2004, pp. 78–81 (2004)

    Google Scholar 

  19. Jedwab, J., Parker, M.G.: Golay complementary array pairs. Designs, Codes and Cryptography 44, 209–216 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  20. Fiedler, F., Jedwab, J., Parker, M.G.: A Multi-dimensional Approach to the Construction and Enumeration of Golay Complementary Sequences. J. Combinatorial Theory (Series A) 115, 753–776 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  21. Schmidt, K.-U.: On Cosets of the Generalized First-Order Reed-Muller Code with Low PMEPR. IEEE Trans. Inform. Theory 52(7), 3220–3232 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  22. Suehiro, N.: Complete Complementary Codes Composed of N-multiple Shift Orthogonal Sequences. IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences J65-A(11), 1247–1253 (1982) (in Japanese)

    Google Scholar 

  23. Parker, M.G.: Close Encounters with Boolean Functions of Three Different Kinds. Invited Talk. In: Barbero, Á. (ed.) ICMCTA 2008. LNCS, vol. 5228, pp. 137–153. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  24. Bjørstad, T.E., Parker, M.G.: Equivalence Between Certain Complementary Pairs of Types I and III. In: Preneel, B., Dodunekov, S., Rijmen, V., Nikova, S. (eds.) Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes. Invited talk at NATO Science for Peace and Security Series - D: Information and Communication Security, vol. 23 (June 2009)

    Google Scholar 

  25. Parker, M.G.: Polynomial Residue Systems via Unitary Transforms. In: Invited talk in Post-Proceedings of Contact Forum Coding Theory and Cryptography III, The Royal Flemish Acadamy of Belgium for Science and the Arts, Brussels, Belgium

    Google Scholar 

  26. Riera, C., Parker, M.G.: Boolean functions whose restrictions are highly nonlinear. In: Invited talk at ITW 2010 Dublin - IEEE Information Theory Workshop, August 30 - September 3 (2010)

    Google Scholar 

  27. Danielsen, L.E., Parker, M.G., Solé, P.: The Rayleigh Quotient of Bent Functions. In: Parker, M.G. (ed.) Cryptography and Coding 2009. LNCS, vol. 5921, pp. 418–432. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  28. Carlet, C., Danielsen, L.E., Parker, M.G., Solé, P.: Self-dual bent functions. Int. J. Inform. and Coding Theory 1(4), 384–399 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  29. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Parker, M.G., Riera, C. (2011). Generalised Complementary Arrays. In: Chen, L. (eds) Cryptography and Coding. IMACC 2011. Lecture Notes in Computer Science, vol 7089. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25516-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25516-8_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25515-1

  • Online ISBN: 978-3-642-25516-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics