Constructions of Optimal (υ,{4,5,6},1,Q)-OOCs

Xiyang LI  Pingzhi FAN  Dianhua WU  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E95-A   No.3   pp.669-672
Publication Date: 2012/03/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E95.A.669
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Coding Theory
cyclic packing,  variable-weight optical orthogonal code,  optical code division multiple access,  quality of services,  

Full Text: PDF(91KB)>>
Buy this Article

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.