scientific article; zbMATH DE number 2154148
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].
- On the maximality of linear codes
- An extension of the codes introduced by Séguin, Allard and Bhargava
- Extendability of ternary linear codes
- An extension theorem for linear codes
- On the extendability of quaternary linear codes with four weights modulo 16
- Large-scale parallelism for constraint-based local search: the costas array case study
- A new extension theorem for linear codes
- Linear codes from a generic construction
- Update on the Extension of Good Linear Codes
- An extension theorem for arcs and linear codes
- Adding a parity-check bit
- The Extended Codes of Some Linear Codes
- A generalized extension theorem for linear codes
- \((l,s)\)-extension of linear codes
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)