New optimal optical orthogonal codes by restrictions to subgroups

In this paper, we discuss about restrictions of optical orthogonal codes (OOC) to subgroups and obtain variable weight OOCs in which the weight of each codeword is lower and upper bounded in relation to a character sum over finite fields. We show that the following three new series of optimal or asymptotically optimal constant weight OOCs are included in those variable weight ones: (i) an optimal -OOC with e codewords; (ii) an optimal -OOC with e codewords; and (iii) an asymptotically optimal -OOC with e(q−1) codewords.