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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A class of binary sequences with period $2p$ is constructed using generalizedcyclotomic classes, and their linear complexity, minimal polynomial over${\mathbb{F}_{{q}}}$ as well as 2-adic complexity are determined using Gaussperiod and group ring theory. The results show that the linear complexity ofthese sequences attains the maximum when $p\equiv \pm 1(\bmod~8)$ and is equalto {$p$+1} when $p\equiv \pm 3(\bmod~8)$ over extension field. Moreover, the2-adic complexity of these sequences is maximum. According toBerlekamp-Massey(B-M) algorithm and the rational approximation algorithm(RAA),these sequences have quite good cryptographyic properties in the aspect oflinear complexity and 2-adic complexity.

Linear complexity over ${\mathbb{F}_{{q}}}$ and 2-adic complexity of a  class of binary generalized cyclotomic sequences with low-value  autocorrelation