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

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

2006-01-20

arxiv.org/abs/cs/0601088v1

Computer Science

Information Theory

4 pages, 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An Algorithm for Constructing All Families of Codes of Arbitrary Requirement in an OCDMA System does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Algorithm for Constructing All Families of Codes of Arbitrary Requirement in an OCDMA System, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Algorithm for Constructing All Families of Codes of Arbitrary Requirement in an OCDMA System will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-9343