Constructing optimal few weight quaternary linear codes via multivariable functions (Q7016068)

Let \(C\) be a linear code over \(\mathbb{Z}_4\) of length \(n\), then \(C_t=\{(c_1,\ldots, c_{t-1}, c_{t+1}, \ldots, c_n)\) \(\vert (c_1,\ldots, c_t, \ldots , c_n) \in C\) with \(c_t=0\}\) is the shortened code of \(C\) on \(t.\) A code \(C\) is called Plotkin-optimal if \(w_L (C) = \lfloor \frac{n}{1-1/|C|}\rfloor\) and near Plotkin-optimal if \(w_L(C)=\lfloor \frac{n}{1-1/|C|}\rfloor-1,\) where the minimum Lee weight of \(C\) is denoted by \(w_L(C).\)\N\NIn this paper, the authors construct new infinite families of (near) Plotkin-optimal 2-weight or 3-weight codes over \(\mathbb{Z}_4\) using the shortening method. Furthermore, the Lee weight distributions of the shortened codes are determined. This is achieved by studying certain families of multivariable functions and by interpreting the shortening method in terms of these functions. Thus, an explicit determination of the Lee weight distributions of the shortened code families is shown. This is not a small achievement since it is difficult to determine the weight distribution of a shortened code \(C_t\) by using the weight distribution of the initial code \(C.\)