English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The autocorrelation and the linear complexity of a key stream sequence in astream cipher are important cryptographic properties. Many sequences with thesegood properties have interleaved structure, three classes of binary sequencesof period $4N$ with optimal autocorrelation values have been constructed byTang and Gong based on interleaving certain kinds of sequences of period $N$.In this paper, we use the interleaving technique to construct a binary sequencewith the optimal autocorrelation of period $2N$, then we calculate itsautocorrelation values and its distribution, and give a lower bound of linearcomplexity. Results show that these sequences have low autocorrelation and thelinear complexity satisfies the requirements of cryptography.

Linear Complexity and Autocorrelation of two Classes of New Interleaved Sequences of Period $2N$