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

The determination of the linear complexity of the product of two shift-register sequences is a basic problem in the theory of stream ciphers. We present for the first time a lower bound for the linear complexity of the product of two shift-register sequences in the general case. Moreover, we provide information on the minimal polynomial of such a product.

A general lower bound for the linear complexity of the product of shift-register sequences