On optimal linear codes over F₈
Let \(n_q(k, d)\) be the smallest integer \(n\) for which there exists an \([n,k,d]_q\) code for given \(q\), \(k\), \(d\). It is known that \(n_8(4, d)=\sum^3_{i=0} \lceil d/8^i\rceil\) for all \(d\geq 833\). As a continuation of \textit{C. Jones}, \textit{A. Matney} and \textit{H. Ward} [Electron. J. Comb. 13, No. 1, Research paper R43, 21 p. (2006; Zbl 1165.94328)], we determine \(n_8(4, d)\) for \(117\) values of \(d\) with \(1\leq d\leq 832\) and give upper and lower bounds on \(n_8(4, d)\) for other \(d\) using geometric methods and some extension theorems for linear codes.
- Nonexistence of linear codes meeting the Griesmer bound
- Categorizing all linear codes of IPM over \(\mathbb{F}_{2^8} \)
- An infinite family of Griesmer quasi-cyclic self-orthogonal codes
- An optimal linear code over \(\mathbb F_{11}\)
- On optimal linear codes of dimension 4
- New bounds on binary linear codes of dimension eight (Corresp.)
- Extension theorems for linear codes over finite fields
- Further Results on the Optimal Sequence Family $\mathcal {IP}_{8}$ Over 8-Ary Q-PAM Constellation
- On the maximum length of coil-in-the-box codes in dimension 8
- On the minimum length of linear codes over the field of 9 elements
- Non-existence of some 4-dimensional Griesmer codes over finite fields
- Nonexistence of some four dimensional linear codes attaining the Griesmer bound
- A generalized extension theorem for linear codes
- Nonexistence of some Griesmer codes over \(\mathbb{F}_q\)
This page was built for publication: On optimal linear codes over \(\mathbb F_8\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625406)
