Title
Correlation Of Column Sequences From The Arrays Of Sidelnikov Sequences Of Different Periods
Abstract
We show that the non-trivial correlation of two properly chosen column sequences of length q - 1 from the array structure of two Sidelnikov sequences of periods q(e) - 1 and q(d) - 1, respectively, is upper-bounded by (2d - 1) root q + 1, if 2 <= e < d < 1/2 (root q - 2/root q + 1). Based on this, we propose a construction by combining properly chosen columns from arrays of size (q - 1) x q(e) - 1/q-1 with e = 2, 3,..., d. The combining process enlarge the family size while maintaining the upper-bound of maximum non-trivial correlation. We also propose an algorithm for generating the sequence family based on Chinese remainder theorem. The proposed algorithm is more efficient than brute force approach.
Year
DOI
Venue
2019
10.1587/transfun.E102.A.1333
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
Keywords
Field
DocType
Sidelnikov sequences, array structure, correlation
Discrete mathematics,Correlation,Mathematics
Journal
Volume
Issue
ISSN
E102A
10
0916-8508
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Min Kyu Song100.68
Hong-Yeop Song232951.84