SEARCH

SEARCH BY CITATION

Keywords:

  • optical orthogonal code;
  • optimal;
  • H design;
  • semi-cyclic

Abstract

In this paper, we are concerned about optimal (v, 4, 3, 2)-OOCs. A tight upper bound on the exact number of codewords of optimal (v, 4, 3, 2)-OOCs and some direct and recursive constructions of optimal (v, 4, 3, 2)-OOCs are given. As a result, the exact number of codewords of an optimal (v, 4, 3, 2)-OOC is determined for some infinite series.