A property of the relative subcodes (Q545442)

Let \(C\) be a linear \([n,k]\) code with a fixed \(k_1\)-dimensional subcode \(C_1\). Let \(J\) be a subset of \(I =\{1,2,\dots,n\}\). Define \(C_J =\{(c_1,c_2,\dots,c_n) \in C \mid c_t=0\) for \( t \notin J\}\). \(C_J\) is a subcode of \(C\). For any subcode \(D\) of \(C\), \(\chi(D)\), the support of \(D\), is defined to be the set of positions where not all codewords of \(D\) have zero coordinates. Define the support weight of \(D\) to be \(w(D)= |\chi(D)|\). The relative generalized Hamming weight (RGHW) of \(C\) is a sequence \((M_1,M_2,\dots, M_{k-k_1})\), where \(M_j=\) min\(\{w(D) \mid D\) is a \(j\)-dimensional subcode of \(C\) and \(D\cap C_1=0\}\) for \(j=1,2,\dots, k-k_1\). A relative \((r,\theta)\) subcode, briefly called an \((r,\theta)\) subcode, is an \(r\)-dimensional subcode of \(D\) of \(C\) such that dim\((D\cap C_1)=\theta\). Using projective geometry and the RGHW, the authors investigate the support weights of subcodes. Their main result improves a result due to \textit{Z. Liu} and \textit{W. Chen} [``Notes on the value function,'' Des. Codes Cryptography 54, No.\,1, 11--19 (2010; Zbl 1185.94088)] on the support weight of subcodes.