The MacWilliams Identity for the m-Spotty Weight Enumerators over ${\mathbb{Z}}_p{R}_k$

Abstract

In this paper, we investigate the m-spotty weight enumerators over the mixed alphabet ${\mathbb{Z}}_p{R}_k$. Specifically, we construct the Gray map from ${\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }$ to ${\mathbb{Z}}_p^{\alpha +k\beta }$, where $R_k={\mathbb{Z}}_p+v{\mathbb{Z}}_p+v^2{\mathbb{Z}}_p+\cdots +v^{k-1}{\mathbb{Z}}_p$ with $v^k=0$ and $k\ge 5$. Based on this framework, we establish the MacWilliams identity for the m-spotty weight enumerators between a linear code and its dual over ${\mathbb{Z}}_p{R}_k$, by employing the generalized Hadamard transform and the canonical additive character of ${\mathbb{Z}}_p$. Finally, an example is presented to illustrate and validate the theoretical results.

1. Introduction

In coding theory, it is customary to use generating functions that enumerate codewords by their Hamming weights to evaluate the probability of decoding errors over noisy channels. This generating function, which takes the form of a polynomial, is known as the weight enumerator. In 1963, MacWilliams established a fundamental relation between the weight enumerators of a linear code and its dual, now known as the MacWilliams identity. This identity has become one of the cornerstones of algebraic coding theory, providing a powerful connection between a code and its dual [1,2,3,4,5].

Error control codes play a vital role in enhancing the reliability of communication and data storage systems. To address more complex noise environments, spotty and m-spotty byte error models were introduced [6]. These models, which generalize the classical bit-level error model introduced by Shannon, allow for the detection and correction of localized byte errors and thus require generalized weight functions beyond the standard Hamming weight.

In recent years, many researchers have extended the MacWilliams identities to a variety of weights and algebraic structures, including finite rings. For instance, Suzuki et al. [7] derived the MacWilliams identity for binary m-spotty weight enumerators. Siap and Özen [8,9] generalized these results to finite fields and to rings such as ${\mathbb{F}}_2+u{\mathbb{F}}_2$ with $u^2=0$, and further to ${\mathbb{F}}_2+u{\mathbb{F}}_2+\cdots +u^{m-1}{\mathbb{F}}_2$ with $u^m=0$. They also established the corresponding identities for RT-weight enumerators over arbitrary finite fields [10,11]. Moreover, Siap [12] obtained the MacWilliams identity for m-spotty Lee weight enumerators over ${\mathbb{Z}}_4$. Subsequently, Sharma and Sharma [12] investigated m-spotty weight enumerators over integer modular rings and two-byte error control codes, deriving several applications and their associated MacWilliams identities. A general overview of such developments can be found in [13].

In this work, we continue this line of research by introducing the m-spotty weight and the associated weight enumerators over the mixed ring ${\mathbb{Z}}_p{R}_k$, where ${\mathbb{Z}}_p$ denotes the ring of integers modulo p and $R_k={\mathbb{Z}}_p+v{\mathbb{Z}}_p+v^2{\mathbb{Z}}_p+\cdots +v^{k-1}{\mathbb{Z}}_p$ with $v^k=0$ and $k\ge 5$. We then establish the MacWilliams identity for linear codes over this mixed alphabet and their duals. The paper is organized as follows. Section 2 recalls basic concepts and preliminaries. Section 3 presents the MacWilliams identity for m-spotty weight enumerators over ${\mathbb{Z}}_p{R}_k$. Section 4 concludes the paper.

2. Preliminaries

Let R be a finite commutative ring. A linear code of length n over R is an R-submodule of $R^n$. A matrix G is called a generator matrix of the linear code $\mathcal{C}$ if the rows of G generate $\mathcal{C}$ as an R-module. For any vector $\mathbf{x}=(x_1,x_2,\dots ,x_n)\in R^n$, the Hamming weight of $\mathbf{x}$ is defined as $w_H\left(\mathbf{x}\right)=\left|\{i\mid x_i\ne 0,1\le i\le n\}\right|.$ For any $\mathbf{x}=(x_1,\dots ,x_n)$ and $\mathbf{y}=(y_1,\dots ,y_n)\in R^n$, the Hamming distance between $\mathbf{x}$ and $\mathbf{y}$ is

$$d(\mathbf{x},\mathbf{y})=\left|\{i\mid x_i\ne y_i,1\le i\le n\}\right|.$$

2.1. The MacWilliams Identity over the Finite Field ${\mathbb{F}}_q$

Let ${\mathbb{F}}_q$ denote the finite field with q elements, where q is a prime power. An $[n,k,d]$ linear code $\mathcal{C}$ over ${\mathbb{F}}_q$ is a k-dimensional subspace of ${\mathbb{F}}_q^n$, where d is the minimum nonzero Hamming weight of $\mathcal{C}$. Let $A_i$ denote the number of codewords in $\mathcal{C}$ with Hamming weight i, where $i=0,1,\dots ,n$. Then the vector $(A_0,A_1,\dots ,A_n)$ is called the weight distribution of $\mathcal{C}$, and the polynomial $A\left(z\right)=A_0+A_{1}z+\cdots +A_n{z}^n$ is the weight enumerator of $\mathcal{C}$. The dual code of a linear code $\mathcal{C}$ is defined by ${\mathcal{C}}^{\perp }=\{\mathbf{x}\in {\mathbb{F}}_q^n\mid \mathbf{x}·\mathbf{y}=0,\forall \mathbf{y}\in \mathcal{C}\}$, where $\mathbf{x}·\mathbf{y}=x_1{y}_1+x_2{y}_2+\cdots +x_n{y}_n.$ for vectors $\mathbf{x}=(x_1,\dots ,x_n)$ and $\mathbf{y}=(y_1,\dots ,y_n)\in {\mathbb{F}}_q^n$.

The MacWilliams identity establishes the relation between the weight enumerators of a code and its dual.

Theorem 1. 

Let $\mathcal{C}$ be an $[n,k]$ linear code over ${\mathbb{F}}_q$ with weight enumerator $A\left(z\right)$. Let $B\left(z\right)$ denote the weight enumerator of its dual code ${\mathcal{C}}^{\perp }$. Then

$$B\left(z\right)=q^{-k}{(1+(q-1)z)}^{n}A\left({\displaystyle \frac{1-z}{1+(q-1)z}}\right).$$

2.2. Codes over the Mixed Ring ${\mathbb{Z}}_p{R}_k$

Throughout this paper, let ${\mathbb{Z}}_p$ denote the ring of integers modulo p, and let $R_k={\mathbb{Z}}_p+v{\mathbb{Z}}_p+v^2{\mathbb{Z}}_p+\cdots +v^{k-1}{\mathbb{Z}}_p,$ where $v^k=0$ and $k\ge 5$. For any vectors $\mathbf{x}=(x_1,\dots ,x_{\alpha }\mid x_{\alpha +1},\dots ,x_{\alpha +\beta }),\mathbf{y}=(y_1,\dots ,y_{\alpha }\mid y_{\alpha +1},\dots ,y_{\alpha +\beta })$ in ${\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }$, their inner product is defined as

$$\langle \mathbf{x},\mathbf{y}\rangle =v^{k-1}\sum _{i=1}^{\alpha }{x}_i{y}_i+\sum _{i=\alpha +1}^{\alpha +\beta }{x}_i{y}_i.$$

For any element $s=s_0+s_{1}v+\cdots +s_{k-1}{v}^{k-1}\in R_k$, define the projection $\eta \left(s\right)=s_0$. For $s\in R_k$ and $\mathbf{x}\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }$, define $s\mathbf{x}=(\eta \left(s\right)x_1,\dots ,\eta \left(s\right)x_{\alpha }\mid s{x}_{\alpha +1},\dots ,s{x}_{\alpha +\beta }).$ A linear code $\mathcal{C}$ of type $(\alpha ,\beta )$ over ${\mathbb{Z}}_p{R}_k$ is defined as a $R_k$-submodule of ${\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }$ under the above multiplication.

The dual code of a linear code $\mathcal{C}$ of type $(\alpha ,\beta )$ over ${\mathbb{Z}}_p{R}_k$ is given by

$${\mathcal{C}}^{\perp }=\{\mathbf{y}\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }\mid \langle \mathbf{x},\mathbf{y}\rangle =0,\forall \mathbf{x}\in \mathcal{C}\}.$$

The Gray map $\phi :{\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }\to {\mathbb{Z}}_p^{\alpha +k\beta }$ is defined by

$$\phi (a\mid b)=(a_1,\dots ,a_{\alpha }\mid \varphi \left(b_1\right),\dots ,\varphi \left(b_{\beta }\right)),$$

where the component map $\varphi :R_k\to {\mathbb{Z}}_p^k$ is given by

$$\varphi (s_0+s_{1}v+\cdots +s_{k-1}{v}^{k-1})=(s_0+s_1+\cdots +s_{k-1},s_1+\cdots +s_{k-1},\dots ,s_{k-1}).$$

2.3. The m-Spotty Weight over ${\mathbb{Z}}_p{R}_k$

Let $c=(c_{11},\dots ,c_{1b},\dots ,c_{n1},\dots ,c_{nb})\in R^{nb}$ be a codeword of length $N=nb$. The i-th byte of c is denoted by $c_i=(c_{i1},c_{i2},\dots ,c_{ib})$. For a byte of length b, if at most t errors occur in that byte, then such an error is called an m-spotty byte error or a $t/b$-error, where $1\le t\le b$ [14].

Definition 1. 

Let $e\in R^N$ be an error vector, and let $e_i\in R^b$ be its i-th byte ($1\le i\le n$). Them-spotty weight of e is defined as

$$w_M\left(e\right)=\sum _{i=1}^n⌈{\displaystyle \frac{w_H\left(e_i\right)}{t}}⌉,$$

where $\lceil x\rceil$ denotes the smallest integer not less than x [14]. If $t=1$, then $w_M\left(e\right)=w_H\left(e\right)$, i.e., the standard Hamming weight. If $t=b$, then the m-spotty Hamming weight coincides with the usual Hamming weight over ${\mathbb{F}}_p^b$.

For ${\mathbb{Z}}_p{R}_k=\{(e_1,e_2)\mid e_1\in {\mathbb{Z}}_p,e_2\in R_k\}$, errors may occur in both components $e_1$ and $e_2$. Since it is difficult to compute the m-spotty weight directly on $R_k$, we apply the mapping $\varphi$ to convert elements in $R_k$ and then compute the m-spotty weight by counting the nonzero components.

Definition 2. 

For any element $(a^{\alpha }\mid a^{\beta })=(a_1,\dots ,a_{\alpha }\mid a_{\alpha +1},\dots ,a_{\alpha +\beta })\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta },$ define $w_M(a^{\alpha }\mid a^{\beta })=w_M\left(a^{\alpha }\right)+w_M\left(a^{\beta }\right)$. Let $\mathcal{C}$ be a linear code of type $(\alpha ,\beta )$ over ${\mathbb{Z}}_p{R}_k$ and $N=\alpha +k\beta$. Then them-spotty weight enumerator of $\mathcal{C}$ is defined by

$$W_{M_{\mathcal{C}}}(x,y)=\sum _{c\in \mathcal{C}}{x}^{N-w_M\left(c\right)}{y}^{w_M\left(c\right)}=\sum _{i=0}^N{A}_i{x}^{N-i}{y}^i,$$

where $(A_0,A_1,\dots ,A_N)$ denotes the m-spotty weight distribution of $\mathcal{C}$.

In ${\mathbb{Z}}_p$, let $\xi =e^{{\displaystyle \frac{2\pi i}{p}}}$. The canonical additive character of ${\mathbb{Z}}_p$ is $\chi \left(x\right)={\xi }^x$ for $x\in {\mathbb{Z}}_p$. Any element $r\in R_k$ can be uniquely expressed as

$$r=a_0+a_{1}v+\cdots +a_{k-1}{v}^{k-1},a_i\in {\mathbb{Z}}_p.$$

Then the canonical additive character on $R_k$ is defined as

$$\chi \left(r\right)={\xi }^{a_{k-1}}.$$

Consequently, for any element $e=(e_1,e_2)\in {\mathbb{Z}}_p{R}_k$, where $e_1\in {\mathbb{Z}}_p$ and $e_2={\sum }_{i=0}^{k-1}{a}_i{v}^i\in R_k$, the corresponding character is

$$\chi \left(e\right)={\xi }^{e_1+a_{k-1}}.$$

3. MacWilliams Identity for m-Spotty Weight over ${\mathbb{Z}}_{\mathbf{p}}^{\mathbf{\alpha }}\times {\mathbf{R}}_{\mathbf{k}}^{\mathbf{\beta }}$

In this section, we establish the MacWilliams identity for the m-spotty weight over ${\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }$. Based on Lemmas 2.1, 2.2, and 2.8 in [8], and by following their proof techniques, we derive the following lemmas.

Lemma 1. 

Let $H\ne \left\{0\right\}$ be an ideal of ${\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }$, and let χ be a character over ${\mathbb{Z}}_p{R}_k$. Then the sum of the character values of all elements in H equals zero, i.e.,

$$\sum _{h\in H}\chi \left(h\right)=0.$$

Lemma 2. 

For any $r\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }$, let χ be a character over ${\mathbb{Z}}_p{R}_k$. Then

$$\sum _{z\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }}\chi \left(rz\right)=\left\{\begin{array}{cc}|{\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }|,\hfill & r=0,\hfill \\ 0,\hfill & r\ne 0.\hfill \end{array}\right.$$

Proof. 

There are three cases to consider:

• If $r=0$, then

  $$\sum _{z\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }}\chi \left(rz\right)=\sum _z\chi \left(0\right)=\sum _{z}1=|{\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }|.$$
• If $r\ne 0$ and $r=v$, then by Lemma 1, we have

  $$\sum _{z\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }}\chi \left(rz\right)=\sum _{z\in \langle v\rangle }\chi \left(z\right)=0,$$

  where $\langle v\rangle$ denotes the ideal generated by v.
• If $r\ne 0$ and $r\ne v$, then similarly, Lemma 1 implies

  $$\sum _{z\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }}\chi \left(rz\right)=\sum _z\chi \left(z\right)=0.$$

This completes the proof. □

Lemma 3. 

Let $\mathcal{C}$ be a linear code over ${\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }$, and let ${\mathcal{C}}^{\perp }$ denote its dual code. Let $f:{\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }\to \mathbb{C}$ be a function, and define

$$\widehat{f}\left(e\right)=\sum _{t\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }}\chi \left(\langle e,t\rangle \right)f\left(t\right),$$

called the generalized Hadamard transform of $f\left(t\right)$. Then

$$\sum _{t\in {\mathcal{C}}^{\perp }}f\left(t\right)={\displaystyle \frac{1}{\left|\mathcal{C}\right|}}\sum _{e\in \mathcal{C}}\widehat{f}\left(e\right).$$

Proof. 

Since $\widehat{f}\left(e\right)={\sum }_{t\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }}\chi \left(\langle e,t\rangle \right)f\left(t\right)$, then

$$\begin{array}{cc}\hfill \sum _{e\in \mathcal{C}}\widehat{f}\left(e\right)& =\sum _{e\in \mathcal{C}}\sum _{t\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }}\chi \left(\langle e,t\rangle \right)f\left(t\right)\hfill \\ \hfill & =\sum _{e\in \mathcal{C}}\sum _{t\in {\mathcal{C}}^{\perp }}\chi \left(\langle e,t\rangle \right)f\left(t\right)+\sum _{e\in \mathcal{C}}\sum _{t\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }\setminus {\mathcal{C}}^{\perp }}\chi \left(\langle e,t\rangle \right)f\left(t\right).\hfill \end{array}$$

For the first half to the right of the equal sign, since $e\in \mathcal{C},t\in {\mathcal{C}}^{\perp }$, then $\langle e,t\rangle =0$. By Lemma 2, it is easy to know that the first half is equal to

$$\left|\mathcal{C}\right|\sum _{t\in {\mathcal{C}}^{\perp }}f\left(t\right).$$

And for the latter half, since $e\in \mathcal{C},t\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }\setminus {\mathcal{C}}^{\perp }$, then $\langle e,t\rangle \ne 0$, From Lemma 2, we know that ${\displaystyle \sum _{e\in \mathcal{C}}}\chi \left(\langle e,t\rangle \right)=0$. Therefore

$$\sum _{e\in \mathcal{C}}\sum _{t\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }\setminus {\mathcal{C}}^{\perp }}\chi \left(\langle e,t\rangle \right)f\left(t\right)=\sum _{t\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }\setminus C^{\perp }}\sum _{e\in \mathcal{C}}\chi \left(\langle e,t\rangle \right)f\left(t\right)=0.$$

Hence

$$\sum _{e\in \mathcal{C}}\widehat{f}\left(e\right)=\sum _{e\in \mathcal{C}}\sum _{t\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }}\chi \left(\langle e,t\rangle \right)f\left(t\right)=\left|\mathcal{C}\right|\sum _{t\in {\mathcal{C}}^{\perp }}f\left(t\right),$$

This means that ${\displaystyle \sum _{t\in {\mathcal{C}}^{\perp }}}f\left(t\right)={\displaystyle \frac{1}{\left|\mathcal{C}\right|}}{\displaystyle \sum _{e\in \mathcal{C}}}\widehat{f}\left(e\right)$. □

Lemma 4. 

Let $u\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }$ and let χ be a character over ${\mathbb{Z}}_p{R}_k$. Then

$$\sum _{s\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }}\chi \left(\langle u,s\rangle \right)x^{N-w_M\left(s\right)}{y}^{w_M\left(s\right)}={(x+(p-1)y)}^{N-w_M\left(u\right)}{(x-y)}^{w_M\left(u\right)},$$

where $N=\alpha +k\beta$.

Proof. 

We first define $N=\alpha +k\beta ,u_{\alpha +j}=u_{\alpha +j}^0+v{u}_{\alpha +j}^1+\cdots +v^{k-1}{u}_{\alpha +j}^{k-1}$, $s_{\alpha +j}=s_{\alpha +j}^0+v{s}_{\alpha +j}^1+\cdots +v^{k-1}{s}_{\alpha +j}^{k-1}$, where $j=1,2,\dots ,\beta$. Then

$$\begin{array}{cc}\hfill \mathrm{left}& =\sum _{s^{\alpha }\in {\mathbb{Z}}_p^{\alpha }}\sum _{s^{\beta }\in R_k^{\beta }}\chi \left(\left.〈u^{\alpha },s^{\alpha }\right)x^{\alpha -w_M\left(s^{\alpha }\right)}{y}^{w_M\left(s^{\alpha }\right)}\chi \left(〈u^{\beta },s^{\beta }〉\right)x^{k\beta -w_M\left(s^{\beta }\right)}{y}^{w_M\left(s^{\beta }\right)}\right.\hfill \\ \hfill & =\left(\prod _{i=1}^{\alpha }\sum _{s_i\in Z_p}{\xi }^{u_i{s}_i}{x}^{1-w_M\left(s_i\right)}{y}^{w_M\left(s_i\right)}\right)\left(\prod _{j=1}^{\beta }\sum _{s_{\alpha +j}\in R_k}{\xi }^{u_{\alpha +j}{s}_{\alpha +j}}{x}^{k-w_M\left(s_{\alpha +j}\right)}{y}^{w_M\left(s_{\alpha +j}\right)}\right).\hfill \end{array}$$

For the first half, according to the definition of m-spotty weight for any t, we have

• If $u_i=1$, then $s_i\ne 0,w_M\left(s_i\right)=1$ or $s_i=0,w_M\left(s_i\right)=0$. After substituting these in, we can obtain

  $$\sum _{s_i\in {\mathbb{Z}}_p}{\xi }^0{x}^{1-w_M\left(s_i\right)}{y}^{w_M\left(s_i\right)}={\xi }^{0}x+\sum _{i=1}^{p-1}{\xi }^{i}y=x-y.$$
• If $u_i=0$, then $s_i\ne 0,w_M\left(s_i\right)=1$ or $s_i=0,w_M\left(s_i\right)=0$. After substituting these in, we can obtain

  $$\sum _{s_i\in {\mathbb{Z}}_p}{\xi }^0{x}^{1-w_M\left(s_i\right)}{y}^{w_M\left(s_i\right)}={\xi }^{0}x+(p-1){\xi }^{0}y=x+(p-1)y.$$

Obviously the degrees of $x+(p-1)y$ and $x-y$ are $1-w_M\left(u_i\right)$ and $w_M\left(u_i\right)$, respectively. The second half of the proof is similar to the first half, then we have

$$\begin{array}{cc}\hfill \mathrm{left}& =\left(\prod _{i=1}^{\alpha }{(x+(p-1)y)}^{1-w_M\left(u_i\right)}{(x-y)}^{w_M\left(u_i\right)}\right)\hfill \\ \hfill & \left(\prod _{j=1}^{\beta }\sum _{{\displaystyle \genfrac{}{}{0pt}{}{s_{\alpha +j}^l\in R_k}{l=0,1,\dots ,k-1}}}{\xi }^{{\displaystyle \sum _{j=1}^{\beta }}{\displaystyle \sum _{{\displaystyle \genfrac{}{}{0pt}{}{n+l=k-1}{n,l\in {\mathbb{Z}}_p}}}}{u}_{\alpha +j}^n{s}_{\alpha +j}^l}{x}^{k-w_M\left(s_{\alpha +j}\right)}{y}^{w_M\left(s_{\alpha +j}\right)}\right)\hfill \\ \hfill & =\left(\prod _{i=1}^{\alpha }{(x+(p-1)y)}^{1-w_M\left(u_i\right)}{(x-y)}^{w_M\left(u_i\right)}\right)\hfill \\ \hfill & \left(\prod _{j=1}^{\beta }{(x+(p-1)y)}^{k-w_M\left(u_{\alpha +j}\right)}{(x-y)}^{w_M\left(u_{\alpha +j}\right)}\right)\hfill \\ \hfill & ={(x+(p-1)y)}^{N-w_M\left(u\right)}{(x-y)}^{w_M\left(u\right)}.\hfill \end{array}$$

This completes the proof. □

Theorem 2. 

Let $\mathcal{C}$ be a linear code over ${\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }$. Then the relation between the m-spotty weight enumerator of $\mathcal{C}$ and its dual ${\mathcal{C}}^{\perp }$ is

$$W_{M_{{\mathcal{C}}^{\perp }}}(x,y)={\displaystyle \frac{1}{\left|\mathcal{C}\right|}}{W}_{M_{\mathcal{C}}}(x+(p-1)y,x-y).$$

Proof. 

Let $f\left(t\right)=x^{N-w_M\left(t\right)}{y}^{w_M\left(t\right)}$, then by Lemma 4 we have

$$\begin{array}{cc}\hfill \widehat{f}\left(e\right)=\sum _{t\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }}\chi \left(\langle e,t\rangle \right)f\left(t\right)& =\sum _{t\in {\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }}\chi \left(\langle e,t\rangle \right)x^{N-w_M\left(t\right)}{y}^{w_M\left(t\right)}\hfill \\ \hfill & ={(x+(p-1)y)}^{N-w_M\left(e\right)}{(x-y)}^{w_M\left(e\right)}.\hfill \end{array}$$

According to Lemma 3, for any $e\in \mathcal{C},t\in {\mathcal{C}}^{\perp }$, we have

$$\begin{array}{cc}\hfill W_{M_{{\mathcal{C}}^{\perp }}}(x,y)& =\sum _{t\in {\mathcal{C}}^{\perp }}{x}^{N-w_M\left(t\right)}{y}^{w_M\left(t\right)}\hfill \\ \hfill & =\sum _{t\in {\mathcal{C}}^{\perp }}f\left(t\right)\hfill \\ \hfill & ={\displaystyle \frac{1}{\left|\mathcal{C}\right|}}\sum _{e\in \mathcal{C}}\widehat{f}\left(e\right)\hfill \\ \hfill & ={\displaystyle \frac{1}{\left|\mathcal{C}\right|}}\sum _{e\in \mathcal{C}}\chi \left(\langle e,t\rangle \right){(x+(p-1)y)}^{N-w_M\left(e\right)}{(x-y)}^{w_M\left(e\right)}\hfill \\ \hfill & ={\displaystyle \frac{1}{\left|\mathcal{C}\right|}}{W}_{M_{\mathcal{C}}}(x+(p-1)y,x-y).\hfill \end{array}$$

This implies that $W_{M_{{\mathcal{C}}^{\perp }}}(x,y)={\displaystyle \frac{1}{\left|\mathcal{C}\right|}}{W}_{M_{\mathcal{C}}}(x+(p-1)y,x-y)$. □

Next, we provide a specific example to illustrate our theorem. For convenience, let $p=3$ and $k=2$. We consider the MacWilliams identity for the m-spotty weight of composite ring ${\mathbb{Z}}_3{R}_2=\left\{\left(e_1,e_2\right)\mid e_1\in {\mathbb{Z}}_3,e_2\in R_2\right\}$.

Example 1. 

Let $\mathcal{C}$ be a linear code over ${\mathbb{Z}}_3^2\times R_2^2$ with generation matrix

$$G_1=\left(\begin{array}{cccc}2& 0& v& 0\\ 0& 1& 0& 2v\end{array}\right).$$

We can verify that the row vector of the matrix is linearly independent and $\left|\mathcal{C}\right|=9$. The m-spotty weight for codewords of $\mathcal{C}$ can be obtained in

Table 1. The m-spotty weight of codewords of $\mathcal{C}$.

Codeword	${\mathit{w}}_{\mathit{M}}\left(\mathit{c}\right)$	Codeword	${\mathit{w}}_{\mathit{M}}\left(\mathit{c}\right)$	Codeword	${\mathit{w}}_{\mathit{M}}\left(\mathit{c}\right)$
$\left(00\right|00)$	0	$\left(02\right|0v)$	2	$\left(22\right|vv)$	4
$\left(01\right|02v)$	2	$\left(10\right|2v0)$	2	$\left(11\right|2v2v)$	4
$\left(20\right|v0)$	2	$\left(21\right|v2v)$	4	$\left(12\right|2vv)$	4

. From this, we can obtain the m-spotty weight distribution of $\mathcal{C}$, as shown in

Table 2. Weight distribution of $\mathcal{C}$.

$w_M\left(c\right)$	0	1	2	3	4
$A_i$	1	0	4	0	4

.

Then we can easily calculate the m-spotty weight enumerators of c by the weight distribution $W_M\left(c\right)=x^6+4x^4{y}^2+4x^2{y}^4.$ Therefore, by Theorem 2, we can obtain

$$\begin{array}{cc}\hfill W_{M_{{\mathcal{C}}^{\perp }}}(x,y)& ={\displaystyle \frac{1}{\left|\mathcal{C}\right|}}{W}_{M_{\mathcal{C}}}(x+(p-1)y,x-y)\hfill \\ \hfill & ={\displaystyle \frac{1}{9}}{W}_{M_{\mathcal{C}}}(x+(p-1)y,x-y)\hfill \\ \hfill & ={\displaystyle \frac{1}{9}}\left({(x+2y)}^6+4{(x+2y)}^4{(x-y)}^2+4{(x+2y)}^2{(x-y)}^4\right)\hfill \\ \hfill & =x^6+4x^5{y}^2+8x^4{y}^2+16x^3{y}^3+20x^3{y}^3+16x{y}^5+16y^6\hfill \end{array}$$

This is the m-spotty weight counter for the corresponding dual code ${\mathcal{C}}^{\perp }$.

4. Conclusions

In this paper, we introduced the concepts of error control codes and MacWilliams identities, and defined the m-spotty weight over the mixed alphabet ${\mathbb{Z}}_p{R}_k$ via a Gray map from ${\mathbb{Z}}_p^{\alpha }\times R_k^{\beta }$ to ${\mathbb{Z}}_p^{\alpha +k\beta }$. By constructing additive characters and employing the generalized Hadamard transform, we derived the MacWilliams identity relating the m-spotty weight enumerators of a code and its dual over ${\mathbb{Z}}_p{R}_k$. Finally, we provided an explicit example to verify the theoretical results.