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

Binary Sidel'nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F 2have even period and almost perfect autocorrelation. However, the evaluation ofthe linear complexity of these sequences is really difficult. In this paper, wecontinue the study of [1]. We first express the multiple roots of characterpolynomials of SLCE sequences into certain kinds of Jacobi sums. Then by makinguse of Gauss sums and Jacobi sums in the "semiprimitive" case, we derive newdivisibility results for SLCE sequences.

Multiplicities of Character Values of Binary Sidel'nikov-Lempel-Cohn-Eastman Sequences