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

Linear codes over finite rings become one of hot topics in coding theoryafter Hommons et al.([4], 1994) discovered that several remarkable nonlinearbinary codes with some linear-like properties are the images of Gray map oflinear codes over $Z_4$. In this paper we consider two series of linear codes$C(G)$ and $\widetilde{C}(G)$ over Galois ring $R=GR(p^2,r)$, where $G$ is asubgroup of $R^{(s)^*}$ and $R^{(s)}=GR(p^2,rs)$. We present a general formulaon $N_\beta(a)$ in terms of Gauss sums on $R^{(s)}$ for each $a\in R$, where$N_\beta(a)$ is the number of a-component of the codeword $c_\beta\in C(G)(\beta\in R^{(s)})$ (Theorem 3.1). We have determined the complete Hammingweight distribution of $C(G)$ and the minimum Hamming distance of$\widetilde{C}(G)$ for some special G (Theorem 3.3 and 3.4). We show a generalformula on homogeneous weight of codewords in $C(G)$ and $\widetilde{C}(G)$(Theorem 4.5) for the special $G$ given in Theorem 3.4. Finally we obtainedseries of nonlinear codes over $\mathbb{F}_{q} \ (q=p^r)$ with two Hammingdistance by using Gray map (Corollary 4.6).

Linear Codes over Galois Ring $GR(p^2,r)$ Related to Gauss sums