Skip to main content
SpringerLink
Log in

Periodic complementary binary sequences and Combinatorial Optimization algorithms

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

We establish a new formalism for problems pertaining to the periodic autocorrelation function of finite sequences, which is suitable for Combinatorial Optimization methods. This allows one to bring to bear powerful Combinatorial Optimization methods in a wide array of problems that can be formulated via the periodic autocorrelation function. Using this new formalism we solve all remaining open problems regarding periodic complementary binary sequences, in the context of the Bömer and Antweiler diagram and thus complete the program that they started in 1990.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bömer L, Antweiler M (1990) Periodic complementary binary sequences. IEEE Trans Inf Theory 36(6):1487–1494

    Article  MATH  Google Scholar 

  • Colbourn CJ, Dinitz JH (eds) (2007) Handbook of combinatorial designs. Discrete mathematics and its applications, 2nd edn. Chapman & Hall/CRC, Boca Raton

    MATH  Google Scholar 

  • Fenimore E, Cannon T (1978) Coded aperture imaging with uniformly redundant arrays. Appl Opt 17:337–347

    Article  Google Scholar 

  • Floudas CA, Pardalos PM (eds) (2001) Encyclopedia of optimization, vols I–VI. Kluwer Academic, Dordrecht

    MATH  Google Scholar 

  • Glover F, Laguna M (1993) Tabu search. In: Reeves C (ed) Modern heuristic techniques for combinatorial problems. Blackwell, Oxford, pp 70–141

    Google Scholar 

  • Golomb SW, Gong G (2005) Signal design for good correlation. For wireless communication, cryptography, and radar. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  • Golomb S, Taylor H (1982) Two-dimensional synchronization patterns for minimum ambiguity. IEEE Trans Inf Theory 28:600–604

    Article  MathSciNet  Google Scholar 

  • Hersheya J, Yarlagadda R (1983) Two-dimensional synchronisation. Electron Lett 19:801–803

    Article  Google Scholar 

  • Kotsireas IS, Koukouvinos C (2008) Periodic complementary binary sequences of length 50. Int J Appl Math 21:509–514

    MATH  MathSciNet  Google Scholar 

  • Kotsireas IS, Koukouvinos C (2007) Hadamard ideals and Hadamard matrices from two circulant submatrices. J Comb Math Comb Comput 61:97–110

    MATH  MathSciNet  Google Scholar 

  • Koukouvinos C (1996) Sequences with zero autocorrelation. In: Colbourn CJ, Dinitz JH (eds) The CRC handbook of combinatorial designs. CRC Press, Boca Raton. Part IV, Chap 42

    Google Scholar 

  • Pardalos PM, Prokopyev OA, Shylo OV, Shylo VP (2008) Global equilibrium search applied to the unconstrained binary quadratic optimization problem. Optim Methods Softw 23(1):129–140

    Article  MATH  MathSciNet  Google Scholar 

  • Pardalos PM, Rodgers GP (1990) Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45:131–144

    Article  MATH  MathSciNet  Google Scholar 

  • Stinson DR (2004) Combinatorial designs. Constructions and analysis. With a foreword by Charles J Colbourn. Springer, New York

    Google Scholar 

  • Weathers G, Holiday EM (1983) Group-complementary array coding for radar clutter rejection. IEEE Trans Aerosp Electron Syst 19:369–379

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Phys. & Comp. Science, Wilfrid Laurier University, Waterloo, ON, N2L 3C5, Canada

    I. S. Kotsireas

  2. Department of Mathematics, National Technical University of Athens, Zografou, 15773, Athens, Greece

    C. Koukouvinos

  3. Department of ISE, University of Florida, Gainesville, FL, USA

    P. M. Pardalos & O. V. Shylo

Authors
  1. I. S. Kotsireas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Koukouvinos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. O. V. Shylo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to P. M. Pardalos.

Additional information

This research is partially supported by NSF, AirForce and NSERC grants.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kotsireas, I.S., Koukouvinos, C., Pardalos, P.M. et al. Periodic complementary binary sequences and Combinatorial Optimization algorithms. J Comb Optim 20, 63–75 (2010). https://doi.org/10.1007/s10878-008-9194-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-008-9194-5

Keywords

Search

Navigation