Optical orthogonal codes-new bounds and an optimal construction

Abstract

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 lambda =2. The parameters (n, omega , lambda ) are respectively (p/sup 2m/-1, p/sup m/+1,2), where p is any prime and the family size is p/sup m/-2. Three distinct upper bounds on the size of an OOC are presented that, for many values of the parameter set (n, omega , lambda ), improve upon the tightest previously known bound.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>