Optimal three-dimensional optical orthogonal codes of weight three (Q2339139): Difference between revisions

Optical orthogonal codes (OOCs) can be considered in the framework of packing designs with an automorphism that acts cyclically on the points. One may generalize OOCs to the \(d\)-dimensional case, where the codewords are \(d\)-dimensional 0-1 matrices. Results on 2-dimensional OOCs are presented, for example, by \textit{R. Omrani} et al. [``Large families of optimal two-dimensional optical orthogonal codes'', IEEE Trans. Inform. Theory 58, No. 2, 1163--1185 (2012; \url{doi:10.1109/TIT.2011.2169299})]. \textit{S. Kim} et. al. [``A new family of space/wavelength/time spread three-dimensional optical code for OCDMA network'', J. Lightwave Technol. 18, No. 4, 502--511 (2000; \url{doi:10.1109/50.838124})] give a motivation for the 3-dimensional case. The author studies 3-dimensional OOCs. In addition to the basic auto-correlation and cross-correlation requirements, some further conditions are assumed here, leading to the study of some subclasses of 3-dimensional OOCs. These subclasses are called SPPC (single-pulse-per-plane code) and AMOPPC (at-most-one-pulse-per-plane code). For certain parameters, the structures are equivalent to generalized Bhaskar Rao group divisible designs, signed over a cyclic group. Particular emphasis is put on the case of weight 3 (when there are exactly three 1s in the 3-dimensional 0-1 matrices).