Constructions for strictly cyclic 3-designs and applications to optimal OOCs with λ=2

  • Authors:
  • Tao Feng;Yanxun Chang;Lijun Ji

  • Affiliations:
  • Institute of Mathematics, Beijing Jiaotong University, Beijing 100044, PR China;Institute of Mathematics, Beijing Jiaotong University, Beijing 100044, PR China;Department of Mathematics, Suzhou University, Suzhou 215006, PR China

  • Venue:
  • Journal of Combinatorial Theory Series A
  • Year:
  • 2008

Quantified Score

Hi-index 0.06

Visualization

Abstract

In this paper we give some recursive constructions for strictly cyclic 3-designs. Using these constructions we have some infinite families of strictly cyclic Steiner quadruple systems and optimal optical orthogonal codes with weight 4 and index 2. As corollaries, many known constructions for strictly cyclic Steiner quadruple systems and optimal optical orthogonal codes are unified. We also notice that there does not exist an optimal (n,4,2)-OOC for any n=0 (mod24). Thus we introduce the concept of strictly cyclic maximal packing quadruple systems to deal with the cases of n=0 (mod24) for (n,4,2)-OOCs. By our recursive constructions, some infinite families are also given on strictly cyclic maximal packing quadruple systems.