Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes (Q2420468)

Optimal 2-dimensional (2-D) \((n \times m, 3, 2, 1)\)-optical orthogonal codes with \(m \equiv 0 \pmod{4}\) are studied in this paper. Using results on the sizes of optimal equi-difference 1-D \((m, 3, 2, 1)\)-optical orthogonal codes, an upper bound on the size of 2-D codes is established. The paper then develops a number of interesting and powerful constructions. These yield an exact determination of the number of codewords of an optimal 2-D \((n \times m, 3, 2, 1)\)-optical orthogonal code when \(n \in \{ 1, 2\}\) and \(m \equiv 0 \pmod{4}\), and when \(n \equiv 0 \pmod{3}\) and \(m \equiv 8 \pmod{16}\), \(m \equiv 32 \pmod{64}\), or \(m \equiv 4,20 \pmod{48}\).