A new recursive construction for optical orthogonal codes

作者：Chu WS^*; Golomb SW

来源：IEEE Transactions on Information Theory, 2003, 49(11): 3072-3076.

DOI：10.1109/TIT.2003.818387

• fiber-optic code-division multiple access
• optical orthogonal codes
• r-simple matrices

In this correspondence, we present a new recursive construction for (n, omega, lambda(a), lambda(c)) optical orthogonal codes. For the case of lambda(a) = lambda(c) = lambda, this recursive construction will enlarge the original family with A unchanged, and produce a new family of asymptotically optimal codes, if the original family is. We call a code asymptotically optimal, following the definition in [7], if, as n, the length of code goes to infinity, the ratio of the number of codewords to the corresponding Johnson bound approaches unity.

• 出版日期2003-11