Ternary linear codes and quadrics (Q1010912)

Summary: For an \([n,k,d]_3\) code \({\mathcal C}\) with \(\gcd(d,3)=1\), we define a map \(w_G\) from \(\Sigma=\mathrm{PG}(k-1,3)\) to the set of weights of codewords of \(\mathcal C\) through a generator matrix \(G\). A \(t\)-flat \(\Pi\) in \(\Sigma\) is called an \((i,j)_t\) flat if \((i,j)=(|\Pi \cap F_0|,|\Pi \cap F_1|)\), where \(F_0 = \{P \in \Sigma\mid w_G(P) \equiv 0 \pmod{3}\}\), \(F_1 = \{P \in \Sigma\mid w_G(P) \not\equiv 0,d \pmod{3}\}\). We give geometric characterizations of \((i,j)_t\) flats, which involve quadrics. As an application to the optimal linear codes problem, we prove the non-existence of a \([305,6,202]_3\) code, which is a new result.