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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

A criterion Is derived for the "q-equipartmon" of the period of m-sequences based on pnmmve trmomlals (PT's), 1 + D q + D" It is shown that the class of PT's with q = 2 t, where t is an integer, can be implemented efficiently so as to produce m parallel q phase-shifted versions of the same m-sequence with relative delays analytically evaluated. These implementations lead to the construction ofeffioent algontlmas for the generation of q-bit pseudorandom number sequences equivalent m correlation performance to the Tausworthe-type generators. The algonthrns are of the GFSR type introduced by Lewis and Payne. The advantage of utthzmg the specific class of PT's is that the mmahzauon procedure is not reqmred. The corresponding linear recurrences threctly yield coding for the generators which delwer q-bit number sequences uncorrelated over a length approximately equal to (2 p l)/q. It is important that three members of this class, of degreesp = 127, 175, 521, respectively, are Merserm¢ prime

Partitioning the Period of a Class of m -Sequences and Application to Pseudorandom Number Generation