Optimal (n,4,2)-OOC of small orders

Wensong Chu, Charles Colbourn

Research output: Contribution to journalArticlepeer-review

29 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)163-172
Number of pages10
JournalDiscrete Mathematics
Issue number1-3
StatePublished - Mar 28 2004


  • Cyclic Steiner quadruple systems
  • Maximal clique problem
  • Optical orthogonal codes
  • r-simple matrices

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Optimal (n,4,2)-OOC of small orders'. Together they form a unique fingerprint.

Cite this