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 p &#x2260; 3 be any prime. The structures of all &#x03BB;-constacyclic codes of length 3ps over the finite commutative chain ring Fpm + uFpm (u2 = 0) are established in the term of their generator polynomials. As an application, Hamming and homogeneous distance of a class of such codes and RT distances of all are given. Among such &#x03BB;-constacyclic codes, the unique maximum-distance-separable (briefly, MDS) code with respect to the RT distance is obtained. Moreover, when &#x03BB; is not a cube in Fpm, the necessary and sufficient condition for the &#x03BB;-constacyclic code of length 3ps over Fpm + uFpm (u2 = 0) be an MDS constacyclic code with respect to Hamming distance is provided.

ieee access

Constacyclic Codes of Length 3<italic>p</italic><italic>s</italic> Over F<italic>p</italic><italic>m</italic> &#x002B; <italic>u</italic>F<italic>p</italic><italic>m</italic> and Their Application in Various Distance Distributions

Constacyclic Codes of Length 3ps Over Fpm + uFpm and Their Application in Various Distance Distributions

Constacyclic Codes of Length 3p^s Over F_p^m + uF_p^m and Their Application in Various Distance Distributions