Binary sequences with period N and nonlinear complexity N-2

Zibi Xiao; Xiangyong Zeng; Chaoyun Li; Yupeng Jiang

doi:10.1007/s12095-018-0324-3

Back

Binary sequences with period N and nonlinear complexity N-2

Journal article

Peer reviewed

Binary sequences with period N and nonlinear complexity N-2

Zibi Xiao, Xiangyong Zeng, Chaoyun Li and Yupeng Jiang

Cryptography and communications, Vol.11(4), pp.735-757

15/07/2019

DOI: https://doi.org/10.1007/s12095-018-0324-3

Abstract

Computer Science

Computer Science, Theory & Methods

Mathematics

Mathematics, Applied

Physical Sciences

Science & Technology

Technology

In this paper, periodic sequences with period N and nonlinear complexity N -2 are investigated. A necessary and sufficient condition for characterizing such sequences is established, and a recursive method is proposed to generate all possible binary sequences with period N and nonlinear complexity N -2. The exact number of such sequences is also determined.

Metrics

2 Record Views

7 Times Cited - Web of Science

Details

Title: Binary sequences with period N and nonlinear complexity N-2
Creators: Zibi Xiao - Hubei University
Xiangyong Zeng - Hubei University
Chaoyun Li - IMEC
Yupeng Jiang - Institute of Information Engineering
Publication Details: Cryptography and communications, Vol.11(4), pp.735-757
Publisher: Springer Nature
Number of pages: 23
Date published: 15/07/2019
Grant note: H2020-MSCA-ITN-2014-643161 ECRYPT-NET / European Union's Horizon 2020 research and innovation program 61472120 / National Natural Science Foundation of China; National Natural Science Foundation of China (NSFC)
Identifiers: 99928569402346
Academic Unit: School of Computer Science and Electronic Engineering
Language: English
Resource Type: Journal article

Binary sequences with period N and nonlinear complexity N-2

Abstract

Metrics

Details

Usage Policy