Constructions of families with unequal auto and cross-correlation constraints
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Research over correlation properties of families optical orthogonal codes
CompSysTech '09 Proceedings of the International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing
Design of two-dimensional wavelength-time codes for fiber-optic CDMA systems
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
IEEE Transactions on Information Theory
New results on optimal (v, 4, 2, 1) optical orthogonal codes
Designs, Codes and Cryptography
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
| Hi-index | 754.90 |
An optical orthogonal code (OOC) is a collection of binary sequences with good auto- and cross-correlation properties; they were defined by Salehi and others as a means of obtaining code-division multiple access on optical networks. Up to now, all work on OOCs have assumed that the constraint placed on the autocorrelation and that placed on the cross-correlation are the same. We consider-codes for which the two constraints are not equal. Specifically we develop bounds on the size of such OOCs and demonstrate constriction techniques for building them. The results demonstrate that a significant increase in the code size is possible by letting the autocorrelation constraint exceed the cross-correlation constraint. These results suggest that for a given performance requirement the optimal OOC may be one with unequal constraints. This paper also views OOCs with unequal auto- and cross-correlation constraints as constant-weight unequal error protection (UEP) codes with two levels of protection. The bounds derived are interpreted from this viewpoint.