On the weight distribution of some minimal codes (Q2657132): Difference between revisions

The main topic in this work are minimal codes. A word \(c\in C\) is minimal if its support does not contain support of any other independent word, and a code \(C\) is minimal if all its nonzero codewords are minimal. This class of codes are quite interesting because of their connection to secret sharing schemes. This paper answers some open questions about the weight distribution of some families of minimal codes introduced by \textit{C. Tang} et al. [``Full characterization of minimal linear codes as cutting blocking sets''; Preprint, \url{arXiv:1911.09867}]. For a multiset \(D=\{P_1,\ldots,P_n\}\) of points in \(\mathrm{AG}(k,q)\) the code \(C_D\) is a code generated by the defining set \(H(P_1),\ldots,H(P_n)\) -- hyperplanes through the origin. Let \(M_1\) and \(M_2\) be two vectorial cutting blocking sets in \(\mathrm{AG}(k, q)\), \(k\geq 2\) such that \(M_1=a.M_1\) for \(a\in F_q^\ast\). The subset of \(\mathrm{AG}(k + 1, q)\) denoted \([\widetilde{M_1, M_2}]= \{(x, 1)\in \mathrm{AG}(k + 1, q) : x \in M_1\}\cup\{(x, 0)\in AG(k + 1, q) : x\in M_2\}\) is a vectorial cutting blocking set in and \([\widetilde{M_1, M_2}]\) is a minimal code of length \((\#M1+\#M2)\) and dimension \(k+1\). For the families of minimal codes \(C_{D_1}, C_{[\widetilde{D_1,D_1}]}, C_{[\widetilde{D_4,D_4}]}, \) the weight distributions are established and the code parameters for \(C_{D_2}, C_{D_3}:\) \(D_1: \left(\sum\limits_{i=1}^{h}{x_i}\right)\prod\limits_{i=1}^{h}{x_i}=0,\) where \(4\leq h\leq k.\) \(D_2: \prod\limits_{1\leq i<j\leq h}^{h}(x_i+x_j)=0,\) where \(3\leq h\leq k.\) \(D_3: \prod\limits_{i=1}^{h}{x_i}\prod\limits_{1\leq i<j\leq h}^{}{(x_i+x_j)}=0,\) where \(3\leq h\leq k.\) \(D_4: \prod\limits_{i=1}^{h}{x_i}=0,\) where \(3\leq h\leq k.\)