New families of binary sequences with optimal three-level autocorrelation

Authors:
Cunsheng Ding;T. Helleseth;H. Martinsen
Affiliations:
Dept. of Inf., Bergen Univ.;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2001

Citing 0
Cited 11

Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation

AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Highly nonlinear mappings

Journal of Complexity - Special issue on coding and cryptography
Codebooks from almost difference sets

Designs, Codes and Cryptography
Binary Sequences with Three and Four Level Autocorrelation

Computational Intelligence and Security
Binary sequences with optimal autocorrelation

Theoretical Computer Science
New classes of optimal frequency-hopping sequences by interleaving techniques

IEEE Transactions on Information Theory
Binary almost-perfect sequence sets

IEEE Transactions on Information Theory
New constructions of binary sequences with optimal autocorrelation value/magnitude

IEEE Transactions on Information Theory
Optimal partitioned cyclic difference packings for frequency hopping and code synchronization

IEEE Transactions on Information Theory
New classes of balanced quaternary and almost balanced binary sequences with optimal autocorrelation value

IEEE Transactions on Information Theory
Optimal difference systems of sets and partition-type cyclic difference packings

Designs, Codes and Cryptography

Quantified Score

Hi-index	755.14

Visualization

Abstract

In this correspondence we give several new families of binary sequences of period N with optimal three-level autocorrelation, where N≡2 (mod 4). These sequences are either balanced or almost balanced. Our construction is based on cyclotomy