The linear complexity is a measure for the unpredictability of a sequence over a finite field. Sequences with good pseudo-random properties and large linear complexity are widely used in the CDMA spread spectrum communication and cryptography. In recent years, many researchers have focused on the linear complexity of cyclotomic sequences such as Sidel'nikov sequence. This paper studies the FM-linear complexity of M-ary Sidel'nikov sequence of period p-1 using the Hasse derivative of its generating function, where M|(p-1). The tth Hasse derivative formulas are generalized in terms of cyclotomic numbers, and then the exact F3-linear complexities of the ternary Sidel'nikov sequences are determined for p = 2•3λ +1(1 ≤ λ ≤ 20). It turns out that all of the linear complexities of the considered sequences are very close to their periods.
|Title of host publication||2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||5|
|Publication status||Published - 2019 Jul|
|Event||2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France|
Duration: 2019 Jul 7 → 2019 Jul 12
|Name||IEEE International Symposium on Information Theory - Proceedings|
|Conference||2019 IEEE International Symposium on Information Theory, ISIT 2019|
|Period||19/7/7 → 19/7/12|
Bibliographical noteFunding Information:
This work is supported by National Natural Science Foundation of China under Grant 61871264 and the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIP) (No.2017R1A2B4011191).
© 2019 IEEE.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modelling and Simulation
- Applied Mathematics