No label defined (Q4945073)

Let \(R\) be a Galois ring of characteristic \(p^e\) and cardinality \(p^{em}\). Any \(R\)-submodule \(C\) of \(\mathbb{R}^n\) is called a linear code of length \(n\) over \(R\). Let \(x = (x_1, x_2, \dots, x_n)\) and \(y = (y_1, y_2, \dots, y_n)\). The dual code \(C^{\perp}\) of \(C\) is defined by \[ C^{\perp} = \{x \in \mathbb{R}^n \mid x_1y_1 + \dots + x_ny_n = 0\;\forall y \in C \}. \] Let \(w_i(c)\), \(1 \leq i \leq r = |R |\), denote the number of coordinates in \(c\) equal to \(i\). The complete weight enumerator is \[ W_C (X_0, X_1, \dots, X_r) = \sum_{c\in C} X_0^{w_0 (c)} X_1^{w_1 (c)} \dots X_r^{w_r (c)}. \] The paper gives the MacWilliams identities between the complete weight enumerator between the code and its dual in the Galois ring case. The result and its proof is very similar to the finite field case. For the entire collection see [Zbl 0933.00056].