Two families of two-weight codes over \(\mathbb{Z}_4\) (Q2211332)

A linear code \(C\) over \(\mathbb{Z}_4\) of length \(n\) is a \(\mathbb{Z}_4\)-submodule of \(\mathbb{Z}_4^n.\) The Lee weight of \(0,1,2,3 \in \mathbb{Z}_4\) are \(0,1,2,1,\) respectively. The Lee weight of any vector \(\mathbf{x}=(x_1,x_2,\ldots,x_n) \in\mathbb{Z}_4^n\) is define as \(W_L(\mathbf{x})=\sum_{i=1}^{n}W_L(x_i).\) The linear code \(C\) is called a two-Lee weight code if all nonzero codewords, i.e. vectors in \(C,\) have exactly two different Lee weights. The inner product of any vectors \(\mathbf{x}=(x_1,x_2,\ldots,x_n)\) and \(\mathbf{y}=(y_1,y_2,\ldots,y_n)\) in \(\mathbb{Z}_4^n\) is defined by \[ \mathbf{x} \cdot \mathbf{y}=x_1y_1+x_2y_2+\cdots+x_ny_n. \] The dual code of \(C\) is defined as \[ C^\perp=\{\mathbf{x} \in\mathbb{Z}_4^n:~\mathbf{x} \cdot \mathbf{y}=0,~ \forall \mathbf{y} \in C\}. \] A Lee weight projective code \(C\) of length \(n\) over \(\mathbb{Z}_4\) is a linear code such that the minimum nonzero Lee weight of its dual is at least three. In the paper under review, the authors construct two infinite families of two-weight codes over \(\mathbb{Z}_4\) (Lemma 4.1 and Theorem 4.2 [see also Corollary 4.5]). As by-products, they obtain two infinite families of two-weight projective codes over \(\mathbb{Z}_4\) (Theorem 4.9 and Corollary 4.10).