Variants of Jacobi polynomials in coding theory (Q2109384)

Let \(\mathcal{R}\) be either the finite field \(\mathbb{F}_{q}\) of order \(q=p^m\) or the ring \(\mathbb{Z}_{k}\) of integers modulo \(k\) for some positive integer \(k \geq 2\). For a linear code \(C\) over \(\mathcal{R}\), denote \(T_{R}^{C, \mathbf{w}}=\left\{\mathbf{u} \in C \mid \operatorname{comp}_{\mathbf{w}}(\mathbf{u})=R\right\}\) and \(B_{R}^{C, \mathbf{w}}=\left|T_{R}^{C, \mathbf{w}}\right|\). The composition of an element \(\mathbf{u} \in\mathcal{R}^{n}\) is defined as \(\operatorname{comp}(\mathbf{u})=\ell(\mathbf{u})=\left(\ell_{a}(\mathbf{u}): a \in\mathcal{R}\right)=r(u;w)\), where \(\ell_{a}(\mathbf{u})\) denotes the number of coordinates of \(\mathbf{u}\) that are equal to \(a \in\mathcal{R}\). The complete Jacobi polynomial of \(C\) with respect to \(\mathbf{w} \in\mathcal{R}^{n}\) is \[ \mathrm{Jac}\left(C, \mathbf{w} ;\left\{x_{a}\right\}_{a \in\mathcal{R}^2}\right)=\sum_{\mathbf{u} \in C} \prod_{a \in\mathcal{R}^2} x_{a}^{r_{a}(\mathbf{u} ; \mathbf{w})}=\sum_{R} B_{R}^{C, \mathbf{w}} \prod_{a \in\mathcal{R}^2} x_{a}^{R_{a}}. \] The main aim of the authors of this work is to study the complete joint Jacobi polynomials of codes over \(\mathcal{R}\) and obtain the MacWilliams type identity for the polynomials. The complete joint Jacobi polynomial of \(C\) and \(D\) with respect to \(\mathbf{w} \in\mathcal{R}^{n}\) is denoted by \[ \mathfrak{Jac}\left(C, D, \mathbf{w} ;\left\{x_{a}\right\}_{a \in\mathcal{R}^3}\right) =\sum_{\mathbf{u} \in C, \mathbf{v} \in D} \prod_{a \in \mathcal{R}^3} x_{a}^{h_{a}(\mathbf{u}, \mathbf{v} ; \mathbf{w})}=\sum_{H} B_{H}^{C, D, \mathbf{w}} \prod_{a \in\mathcal{R}^3} x_{a}^{H_{a}}. \] In this context, the average Jacobi polynomial is defined as \[ \mathrm{Jac}^{a v}\left(C, \mathbf{w} ;\left\{x_{a}\right\}_{a \in \mathcal{R}^2}\right)=\frac{1}{n !} \sum_{\sigma \in S_{n}} \mathrm{Jac}\left(C^{\sigma}, \mathbf{w} ;\left\{x_{a}\right\}_{a \in \mathcal{R}^2}\right) \] and the average complete joint Jacobi polynomial \[ \mathfrak{Jac}^{a v}\left(C, D, \mathbf{w} ;\left\{x_{a}\right\}_{a \in \mathcal{R}^3}\right)=\frac{1}{n !} \sum_{\sigma \in S_{n}} \mathfrak{Jac}\left(C^{\sigma}, D, \mathbf{w} ;\left\{x_{a}\right\}_{a \in\mathcal{R}e^3}\right). \] of codes are defined. A representation of the average of the complete joint Jacobi polynomials of two codes \(C\) and \(D\) of length \(n\) with respect to \(\mathbf{w} \in\mathcal{R}^{n}\) by using the compositions of \(n\) and its distribution in the codes is proven. Moreover, as a generalization of the complete joint Jacobi polynomials and the average complete joint Jacobi polynomials the concept of the \(g\)-fold complete joint Jacobi polynomials and the average \((g+1)\)-fold complete joint Jacobi polynomials of codes over \(\mathcal{R}\) is introduced. This work also defines the average Jacobi intersection number and a formula to compute these numbers is derived. To illustrate these formulas, some numerical examples of the average Jacobi intersection number for Type II codes are given.