2-dimensional optical orthogonal codes from Singer groups (Q967355)

Using the construction (of OOCs) in a previous paper [Adv. Math. Commun. 2, No. 4, 451--467 (2008; Zbl 1155.94021)] new families of 2-dimensional OOCs codes are presented. With respect to the Johnson bound (related to the maximal number of codewords) the codes constructed are either optimal or are asymptotically optimal. The constructed codes have more flexible dimensions and weight than the previously known J-optimal families.