Abstract
In this Letter, two constructions of new binary sequences with optimal autocorrelation magnitude of length 4N 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 = pn −1 whereas the second one is to use binary Ding–Helleseth–Martinsen sequences of length N = 2p. The obtained sequences have large linear complexity and can be used in communication and cryptography.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
