Get access

Bounds and Constructions on (v, 4, 3, 2) Optical Orthogonal Codes

Authors


  • Contract grant sponsor: NSFC; contract grant numbers: 61071221, 11271042; contract grant sponsor: Fundamental Research Funds for the Central Universities; contract grant number: 2011JBZ012.

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.

Ancillary