New Matrices with Good Auto and Cross-Correlation
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Double periodic arrays with optimal correlation for applications in watermarking
SSC'07 Proceedings of the 2007 international conference on Sequences, subsequences, and consequences
Optical orthogonal codes with unequal auto- and cross-correlation constraints
IEEE Transactions on Information Theory
New constructions of optimal cyclically permutable constant weight codes
IEEE Transactions on Information Theory
Secure spread spectrum watermarking for multimedia
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
Yang and Fuja [1] presented constructions of codes with unequal correlation constraints (λc a). And specifically they have constructions for the case where λa = 2 λc = 1. In their work they argue that it is important to make the cross-correlation (λc) as small as possible, and not necessarily λa = λc. In this work we present a method to generate new Yang-Fuja type families with correlation constraints where λc a. In [12], [10], [9] we presented a method to increase the size of a family of a double periodic sequence with Optical Orthogonal Code (OOC) length n = mp where m = p - 1, and p is a prime. In this work we present a new method that increases the size of a family of double periodic sequences without the restriction on m, we present a method to increase the weight of a double periodic array, and then combine both methods to produce Yang-Fuja type families of double periodic arrays with λc a. One of our main results is a theorem (Theorem 3, Section IV) that estimates λc. With this theorem we obtain two new constructions of Optical Orthogonal Codes with λc a.