Optimal optical orthogonal signature pattern codes with weight three and cross-correlation constraint one
Abstract
Optical orthogonal signature pattern codes (OOSPCs) have attracted wide attention as signature patterns of spatial optical code division multiple access networks. In this paper, an improved upper bound on the size of an (m,n,3,λa,1)-OOSPC with λa=2,3 is established. The exact number of codewords of an optimal (m,n,3,λa,1)-OOSPC is determined for any positive integers m,n2\ ( mod \ 4) and λa∈\2,3\.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.