Topics on optical orthogonal codes

  • Authors:

  • Reza Omrani;Oscar Moreno;P. Vijay Kumar

  • Affiliations:

  • Communication Sciences Institute, Department of Electrical Engineering – Systems, University of Southern California, Los Angeles, CA;Gauss Research Lab, University of Puerto Rico, San Juan, Puerto Rico;Communication Sciences Institute, Department of Electrical Engineering – Systems, University of Southern California, Los Angeles, CA

  • Venue:
  • SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, there has been an upsurge of interest in using Code-Division Multiple-Access communication over optical fiber channels (OCDMA). In this paper we provide a new Johnson-bound-optimal construction of OOC with parameter λ = 1. We use the idea of the same construction to generate OOCs with λ 1. A new bound for optical orthogonal codes based on a known bound for constant weight codes is introduced. This bound is used to prove the optimality of our constructions. We also present a recursive technique for generating OOCs with λ = 1 that makes use of a recursive construction for cyclic block designs by Colbourn and Colbourn [1]. This technique has yielded several new optimal constructions for Optical Orthogonal Codes.