Further Investigations on Nonlinear Complexity of Periodic Binary Sequences-Reference-Cited by-同舟云学术

Further Investigations on Nonlinear Complexity of Periodic Binary Sequences

Published:2024-07 Issue:7 Volume:70 Page:5376-5391
ISSN:0018-9448
Container-title:IEEE Transactions on Information Theory
language:
Short-container-title:IEEE Trans. Inform. Theory

Author:

Yuan Qin¹,Li Chunlei²^ORCID,Zeng Xiangyong¹^ORCID,Helleseth Tor²,He Debiao³^ORCID

Affiliation:

1. Hubei Key Laboratory of Applied Mathematics, Faculty of Mathematics and Statistics, Hubei University, Wuhan, China

2. Department of Informatics, University of Bergen, Bergen, Norway

3. Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering, Wuhan University, Wuhan, Hubei, China

Funder

Major Research Plan of Hubei Province

National Natural Science Foundation of China

Innovation Group Project of the Natural Science Foundation of Hubei Province of China

Fundamental Research Funds for the Central Universities

Norges Forskningsråd

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Link

http://xplorestaging.ieee.org/ielx7/18/10565302/10509726.pdf?arnumber=10509726

Reference33 articles.

1. Shift Register Sequences

2. The definition of random sequences

3. Cryptographic aspects of sequence complexity measures;Wang,1988

4. On the Complexity of Pseudo-Random Sequences - or: If You Can Describe a Sequence It Can’t be Random

5. Some Computable Complexity Measures for Binary Sequences

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Survey on Complexity Measures for Pseudo-Random Sequences;Cryptography;2024-06-13