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 qe − 1 and qd − 1, respectively, is upper-bounded by (2d − 1)q + 1, if 2 ≤ e < d < 2 1 (q − 2 q + 1). Based on this, we propose a construction by combining properly chosen columns from arrays of size (q − 1) × q q e − − 1 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.
| Original language | English |
|---|---|
| Pages (from-to) | 1333-1339 |
| Number of pages | 7 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E102A |
| Issue number | 10 |
| DOIs | |
| Publication status | Published - 2019 |
Bibliographical note
Funding Information:Manuscript received August 13, 2018. Manuscript revised February 28, 2019. †The authors are with Yonsei University, Seoul, Korea. ∗This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIP) (No. 2017R1A2B4011191). This paper was presented in part at 2016 International Symposium on Information Theory. a) E-mail: mk.song@yonsei.ac.kr b) E-mail: hysong@yonsei.ac.kr (Corresponding author) DOI: 10.1587/transfun.E102.A.1333
Publisher Copyright:
Copyright © 2019 The Institute of Electronics, Information and Communication Engineers
All Science Journal Classification (ASJC) codes
- Signal Processing
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering
- Applied Mathematics