Binary Sequences with Three and Four Level Autocorrelation

Authors:
Ying Cai;Zhen Han
Affiliations:
School of Computer Science, Beijing Jiaotong University, Beijing, 100044, China and Department of Computer Science, Beijing Information Science and Technology University, Beijing, 100101, China;School of Computer Science, Beijing Jiaotong University, Beijing, 100044, China
Venue:
Computational Intelligence and Security
Year:
2007

Citing 7
Cited 0

Chinese remainder theorem: applications in computing, coding, cryptography

Chinese remainder theorem: applications in computing, coding, cryptography
Shift Register Sequences

Shift Register Sequences
Autocorrelation values of generalized cyclotomic sequences of order two

IEEE Transactions on Information Theory
Several classes of binary sequences with three-level autocorrelation

IEEE Transactions on Information Theory
New families of binary sequences with optimal three-level autocorrelation

IEEE Transactions on Information Theory
Almost difference sets and their sequences with optimal autocorrelation

IEEE Transactions on Information Theory
Linear Complexity of Generalized Cyclotomic Binary Sequences of Order 2

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Binary sequences with good autocorrelation in ranging systems, spread spectrum communication systems, multi-terminal system identification, code division multiple access communications systems, global positioning systems, software testing, circuit testing, computer simulation, and stream ciphers. In this paper, we present a number of classes of binary sequences with three or four level autocorrelation. Some of them have good autocorrelation.