An Algorithm for Constructing All Families of Codes of Arbitrary Requirement in an OCDMA System

Simple item page
dc.creatorLu, Xiang
dc.creatorChen, Jiajia
dc.creatorHe, Sailing
dc.date2006-01-20
dc.date.accessioned2026-07-07T08:15:52Z
dc.date.available2026-07-07T08:15:52Z
dc.descriptionA novel code construction algorithm is presented to find all the possible code families for code reconfiguration in an OCDMA system. The algorithm is developed through searching all the complete subgraphs of a constructed graph. The proposed algorithm is flexible and practical for constructing optical orthogonal codes (OOCs) of arbitrary requirement. Simulation results show that one should choose an appropriate code length in order to obtain sufficient number of code families for code reconfiguration with reasonable cost.
dc.description4 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/cs/0601088
dc.identifierhttp://arxiv.org/abs/cs/0601088
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133588
dc.subjectInformation Theory
dc.titleAn Algorithm for Constructing All Families of Codes of Arbitrary Requirement in an OCDMA System
dc.typetext

Files

Collections

arXiv