Approaching peak correlation bounds via alternating projections

In this paper, we study the problem of approaching peak periodic or aperiodic correlation bounds for complex-valued sets of sequences. In particular, novel algorithms based on alternating projections are devised to approach a given peak periodic or aperiodic correlation bound. Several numerical examples are presented to assess the tightness of the known correlation bounds as well as to illustrate the effectiveness of the proposed methods for meeting these bounds.