Skip to Main Content
We present a new recursive construction for (n,ω,λa,λc) optical orthogonal codes. For the case of λa = λc = λ, this recursive construction enlarges the original family with λ unchanged, and produces a new family of asymptotically optimal codes, if the original family is asymptotically optimal. We call a code asymptotically optimal, following the definition of O. Moreno et al. (see ibid., vol.41, p.448-55, 1995), if, as n, the length of code, goes to infinity, the ratio of the number of codewords to the corresponding Johnson bound approaches unity.