A New Construction of Optimal Optical Orthogonal Codes From Sidon Sets

Abstract

Two new constructions for families of optical orthogonal codes are presented. The first is a generalization of the well-known construction of Sidon sets given by I. Z. Ruzsa. The second construction is optimal with respect to the Johnson bound, and its parameters $(n,w,\lambda)$ are respectively $(p^{h+1}-p,p,1)$ , where $p$ is any prime, $h$ is an integer greater than 1 and the family size is $p^{h-1}+p^{h-2}+\cdots +p^{2}+p$ .

Keywords

• Optical code-division multiple access (OCDMA)
• optical orthogonal code (OOC)
• optical CDMA
• Sidon set