A general construction of binary interleaved sequences of period \(4{N}\) with optimal autocorrelation

DOI10.1016/j.ins.2014.07.026zbMath1355.94077OpenAlexW1982654704MaRDI QIDQ508658

Yong-Cai Geng, Sumit K. Garg

Publication date: 7 February 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.07.026

zbMATH Keywords

cryptographyCDMAinterleaved sequenceoptimal correlation

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items (3)

The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude ⋮ SOME METHODS TO DESIGN INTERLEAVED SEQUENCES OVER ⋮ The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude

Cites Work

• Unnamed Item
• Crosscorrelation between linearly and nonlinearly distorted versions of a given signal
• WG: a family of stream ciphers with designed randomness properties
• A new family of almost difference sets and some necessary conditions
• New Binary Sequences With Optimal Autocorrelation Magnitude
• Almost difference sets and their sequences with optimal autocorrelation
• Theory and applications of q-ary interleaved sequences
• New Constructions of Binary Sequences With Optimal Autocorrelation Value/Magnitude
• Modifications of Modified Jacobi Sequences

This page was built for publication: A general construction of binary interleaved sequences of period \(4{N}\) with optimal autocorrelation