Optical code-division multiple-access (OCDMA) is a promising technique for multimedia transmission in fiber-optic local-area networks (LANs). Variable-weight optical orthogonal codes (OOCs) can be used for OCDMA networks supporting multiple quality of services (QoS). Most constructions for optimal variable-weight OOCs have focused on the case where the number of distinct Hamming weights of all codewords is equal to two, and the codewords of weight 3 are normally included. In this letter, four explicit constructions of optimal (υ,{4,5,6},1,Q)-OOCs are presented, and more new optimal (υ,{4,5,6},1,Q)-OOCs are obtained via recursive constructions. These improve the existing results on optimal variable-weight OOCs with at least three distinct Hamming weights and minimum Hamming weight 4.

Variable-weight optical orthogonal codes (OOCs) have application in multimedia optical code division multiple access (OCDMA) systems supporting multiple quality of services (QoS). In this paper, several combinatorial constructions for optimal variable-weight OOCs are presented explicitly. A useful recursive construction for optimal variable-weight OOCs is proposed as well. Based on these results, two new infinite classes of optimal variable-weight OOCs with Hamming weights 3 and 4 are obtained.

Sequences with good correlation properties are of substantial interest in many applications. By interleaving a perfect array with shift sequences, a new method of constructing binary array set with zero correlation zone (ZCZ) is presented. The interleaving operation can be performed not only row-by-row but also column-by-column on the perfect array. The resultant ZCZ binary array set is optimal or almost optimal with respect to the theoretical bound. The new method provides a flexible choice for the rectangular ZCZ and the set size.