Adding a parity-check bit

From MaRDI portal





The author proves the following theorem: Let \({\mathcal C}\) be an \([n,k,d]\)-code over a finite field \(\mathbb{F}_q\) of characteristic \(p\). If \(d\not\equiv 0\text{ mod }p\) and \[ \sum_{i\not\equiv d\text{ mod }p} A_i({\mathcal C})= q^{k-1}, \] then \({\mathcal C}\) can be extended to an \([n+1,k,d+1]\)-code.











This page was built for publication: Adding a parity-check bit

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