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

Let B be any nite commutative ring with identity. In this case, B(X; 1 p kZ0) B(X; 1 p 2Z0) B(X; 1 p Z0), where p is a prime number and k 1, is the descending chain of commutative semigroup rings. All these semigroup rings are containing the polynomial ring B(X;Z0). In this paper, we introduced a construction technique of cyclic codes through the semi- group ring B(X; 1 p kZ0) instead of a polynomial ring.

A note over constructions of cyclic codes over certain semigroups