Design of Minimum Correlated, Maximal Clique Sets of One-Dimensional Uni-polar (Optical) Orthogonal Codes
Ram Chandra Singh Chauhan, Yatindra Nath Singh, Rachna Asthana

TL;DR
This paper introduces an algorithm to generate multiple sets of minimal correlated one-dimensional uni-polar optical orthogonal codes, forming maximal cliques, with applications in optical CDMA systems.
Contribution
It presents a novel algorithm for constructing maximal clique sets of minimal correlated 1-DUOC codes with fixed or variable parameters.
Findings
Sets achieve the upper bound of cardinality.
Codes are suitable for spectral spreading in optical CDMA.
Algorithm works for general code parameters.
Abstract
This paper proposes an algorithm to search a family of multiple sets of minimum correlated one dimensional uni-polar (optical) orthogonal codes (1-DUOC) or optical orthogonal codes (OOC) with fixed as well as variable code parameters. The cardinality of each set is equal to upper bound. The codes within a set can be searched for general values of code length, code weight, auto-correlation constraint and cross-correlation constraint. Each set forms a maximal clique of the codes within given range of correlation properties . These one-dimensional uni-polar orthogonal codes can find their application as signature sequences for spectral spreading purpose in incoherent optical code division multiple access (CDMA) systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Wireless Communication Networks Research
