Abstract
In this paper, we show that the cross-correlation of two properly chosen column sequences from the array structure of two different Sidelnikov sequences of periods qe-1 and qF - 1, where e ≠ F, is bounded by (e+F-1)√q+1. From this result, we construct new sequence families by combining sequence families from the array structure of Sidelnikov sequences of period q2 - 1, q3 - 1., qd - 1 for some d with 2 ≤ d ≤ 1/2(√q - 2/√q + 1). The maximum non-trivial complex correlation of any two pair of sequences in the constructed sequence family is upper-bounded by (2d - 1)√q + 1: thus, the combining process does not affect the maximum non-trivial complex correlation.
Original language | English |
---|---|
Title of host publication | Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 105-109 |
Number of pages | 5 |
ISBN (Electronic) | 9781509018062 |
DOIs | |
Publication status | Published - 2016 Aug 10 |
Event | 2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain Duration: 2016 Jul 10 → 2016 Jul 15 |
Publication series
Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|
Volume | 2016-August |
ISSN (Print) | 2157-8095 |
Other
Other | 2016 IEEE International Symposium on Information Theory, ISIT 2016 |
---|---|
Country | Spain |
City | Barcelona |
Period | 16/7/10 → 16/7/15 |
Bibliographical note
Publisher Copyright:© 2016 IEEE.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modelling and Simulation
- Applied Mathematics