Open AccessTwo constructions of binary sequences with optimal autocorrelation magnitude
Author(s) -
Krengel E.I.,
Ivanov P.V.
Publication year - 2016
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2016.2476
Subject(s) - autocorrelation , binary number , mathematics , complementary sequences , pseudorandom binary sequence , magnitude (astronomy) , algorithm , autocorrelation matrix , combinatorics , autocorrelation technique , discrete mathematics , statistics , arithmetic , physics , astronomy
In this Letter, two constructions of new binary sequences with optimal autocorrelation magnitude of length 4 N derived from binary sequences with optimal autocorrelation of length N = 2 (mod 4) and almost‐perfect binary sequences of length 2N using N × 2 interleaved structure is presented. The first construction is to use binary Sidelnikov sequences of length N = p n −1 whereas the second one is to use binary Ding–Helleseth–Martinsen sequences of length N = 2 p . The obtained sequences have large linear complexity and can be used in communication and cryptography.