A New Family of Asymptotically Optimal 2-D Optical Orthogonal Codes

In application, good OOCs have the property that each codeword has many more 0s than 1s. The code length of a conventional 1D-OOC is always large in order to achieve good bit error rate performance. However, long code sequences will occupy a large bandwidth and reduce the bandwidth utilization. 1D-OOCs also suffer from relatively small cardinality. The 2D-OOCs overcome both of these shortcomings. In this paper, we present a new family of 2-D (Lambda x T, omega,kappa) wavelength/ time optical orthogonal codes (2D-OOCs) by projective geometry theory. Function clusters over finite fields are used in the construction. The codes presented are asymptotically optimal with respect to the bound given by Omrani et al. which is an adaptation of the Johnson's bound for OPPW codes.