A General Construction for Optimal Cyclic Packing Designs

Cyclic packing designs of pairs have various applications in communications. In this paper, the concept of a (g1, g2, …, gr; u)-regular cyclic packing design is defined, and used to establish a quite general recursive construction concerning cyclic packing designs. As corollaries, we are able to unify many known constructions for cyclic designs. As an application, we obtain infinite series of new optimal cyclic packing designs which can be utilized directly to produce new optimal optical orthogonal codes.