Ternary linear codes and quadrics

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Review text

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.

Recommendations

Cited in

(15)

This page was built for publication: Ternary linear codes and quadrics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010912)