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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

A 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.
4 pages, 2 figures

Keywords

Information Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/133588

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0601088
 http://arxiv.org/abs/cs/0601088

Collections

arXiv