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 Fpm be a finite field of cardinality p m and R = Fpm[u]/〈u 〉 = Fpm +uFpm (u = 0), where p is a prime and m is a positive integer. For any λ ∈ Fpm, an explicit representation for all distinct λ-constacyclic codes over R of length pn is given by a canonical form decomposition for each code, where s and n are positive integers satisfying gcd(p, n) = 1. For any such code, using its canonical form decomposition the representation for the dual code of the code is provided. Moreover, representations for all distinct negacyclic codes and their dual codes of length pn over R are obtained, and self-duality for these codes are determined. Finally, all distinct self-dual negacyclic codes over F5 + uF5 of length 2 · 5 s · 3 are listed for any positive integer t.

advances in mathematics of communications

Constacyclic codes of length &lt;inline-formula&gt;&lt;tex-math id="M1"&gt;\begin{document}$np^s$\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt; over &lt;inline-formula&gt;&lt;tex-math id="M2"&gt;\begin{document}$\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt;