Local weight enumerators for binary self-dual codes (Q1291126): Difference between revisions

Let \(C\) be a linear self-dual code of length \(n\). For any subset \(\Omega\) of \(\{1,\dots, n\}\), define \[ C_i(\Omega)= \{c= (c_1,\dots, c_n)\in C\mid w(c)=i,\;c_s=1\text{ for }s\in \Omega\}, \] where \(w\) denotes the Hamming weight. For \(1\leq t\leq i\), \(\Omega\) is said to admit the \((t,i)\)-design property provided \(|C_i(\Omega_1)|=|C_i(\Omega_2)|\) for all subsets \(\Omega_1, \Omega_2\) of \(|\Omega_1|, |\Omega_2|= t\). If \(\Omega\) admits the \((t,i)\)-design for every \(i\geq t\), then \(\Omega\) is said to admit the \(t\)-design property. In this paper the \(t\)-design property is analyzed for the special case that \(t=1\) or \(t=2\). In the case \(\Omega= \{u,v\}\), the smallest \(i\) such that \(|C_i(u)|\neq |C_i(v)|\) is called the 1-local minimum weight, \(d(\Omega)\), with respect to \(\Omega\). The polynomial \[ W_{u,v}(\Omega)= \sum_{j=2}^{n-2} x^{n-j-1} y^{j-1} (|C_i(u)|- |C_i(v)|) \] is studied in the paper. An example of the results in the paper is that if \(C\) is a binary self-dual code then \[ W_{u,v}(x,y)= -W_{u,v} \Biggl( \frac{x+y}{\sqrt{2}}, \frac{x-y}{\sqrt{2}}\Biggr). \] The paper contains many results for \(W_{u,v}(x,y)\) analogues to Gleason's theorem for self-dual codes. The author studies the theta functions with spherical coefficients in order to achieve results similar to the MacWilliams' identity and Gleason's theorem for the local (mainly 1-local and 2-local) weight enumerators of binary self-dual codes.