scientific article; zbMATH DE number 2154148

From MaRDI portal
Publication:4664703





The problem of extending a \(q\)-ary \([n,k,d]\)-code to a \(q\)-ary \([n+1,k,d+1]\)-code is investigated. The following result is proven: {Let} \(C\) be an \([n,k,d]\)-code over a finite field \(\mathbb{F}_q\) of characteristic \(p\). If \(d\not\equiv 0 \mod p\) and \[ \sum_{i\not\equiv d \mod p} A_i(C)=q^{k-1}, \] then \(C\) can be extended to an \([n+1,k,d+1]\)-code; here \((A_i(C))_{i=0,\dots,n}\) is the weight distribution of \(C\). This result combined with the MacWilliams identities can be applied to prove the nonexistence of codes with certain parameters. As an example, it is shown that an \([85,6,61]_4\)-code does not exist. For the entire collection see [Zbl 0944.00096].











This page was built for publication:

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