The effects of synchronization on topology-transparent scheduling
Wireless Networks
Constructions for strictly cyclic 3-designs and applications to optimal OOCs with λ=2
Journal of Combinatorial Theory Series A
Slot synchronized topology-transparent scheduling for sensor networks
Computer Communications
Bounds and constructions of optimal (n, 4, 2, 1) optical orthogonal codes
IEEE Transactions on Information Theory
The new method for analyzing bounds of OOC for OCDMA system based on optical code-hoop
AsiaCSN '07 Proceedings of the Fourth IASTED Asian Conference on Communication Systems and Networks
On constructions for optimal two-dimensional optical orthogonal codes
Designs, Codes and Cryptography
Combinatorial constructions for optimal two-dimensional optical orthogonal codes
IEEE Transactions on Information Theory
Two-dimensional optical orthogonal codes and semicyclic group divisible designs
IEEE Transactions on Information Theory
Optical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4
IEEE Transactions on Information Theory
New optimal variable-weight optical orthogonal codes
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
New optimal optical orthogonal codes by restrictions to subgroups
Finite Fields and Their Applications
| Hi-index | 755.08 |
We present a new recursive construction for (n,ω,λa,λc) optical orthogonal codes. For the case of λa = λc = λ, this recursive construction enlarges the original family with λ unchanged, and produces a new family of asymptotically optimal codes, if the original family is asymptotically optimal. We call a code asymptotically optimal, following the definition of O. Moreno et al. (see ibid., vol.41, p.448-55, 1995), if, as n, the length of code, goes to infinity, the ratio of the number of codewords to the corresponding Johnson bound approaches unity.