In this paper, we introduce an algorithmic scheme to find optimal (v,4,2)-OOCs of small orders. We determine the sizes of optimal (v,4,2)-OOCs up to v = 44, with three possible exceptions. We also develop an algebraic method to generate all difference triples over ℤv.
- Cyclic Steiner quadruple systems
- Maximal clique problem
- Optical orthogonal codes
- r-simple matrices
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics