Further results on support weights of certain subcodes (Q717144)

Using the value function introduced by \textit{W. Chen} and \textit{T. Kløve} [IEEE Trans. Inf. Theory 42, No. 6, Pt. 2, 2265--2272 (1996; Zbl 0872.94044)], the authors study support weights of subcodes of linear codes. Here, for a generator matrix \(G\) of a \(k\)-dimensional \(q\)-ary linear code \({\mathcal{C}}\) with length \(n\) and a projective point \(p\) in PG\((k-1,q)\), the value function denotes the number of times that \(p\) occurs as a column of \(\mathcal{C}\). The main result improves a theorem of \textit{Z. Liu} and \textit{W. Chen} [Des. Codes Cryptography 54, No. 1, 11--19 (2010; Zbl 1185.94088)]. It states the following. If \({\mathcal{C}}_1\) is a \(k_1\)-dimensional subcode of \(\mathcal{C}\), and, if for a fixed pair \((r_0,t_0)\) satisfying \(t_0<r_0<k-k_1+t_0\) and \(1\leq t_0\leq k_1-1\), all the \((r_0,t_0)\)-subcodes (that are \(r_0\)-dimensional subcodes \({\mathcal{D}}\) with dim\(({\mathcal{D}} \cap {\mathcal{C}}_1)=t_0\)) have the same support weight, then all the \((r,t)\)-subcodes have the same support weight for any fixed pair \((r,t)\) satisfying \(t\leq r\leq k-k_1+t\) and \(1\leq t\leq k_1\). The new results provide a way to construct a class of two-weight codes.