Optical orthogonal codes-new bounds and an optimal construction

A technique for constructing optimal OOCs (optical orthogonal codes) is presented. It provides the only known family of optimal (with respect to family size) OOCs having λ=2. The parameters (n ,ω,λ) are respectively (p^2m-1, p^m+1,2), where p is any prime and the family size is p^m-2. Three distinct upper bounds on the size of an OOC are presented that, for many values of the parameter set (n,ω,λ), improve upon the tightest previously known bound