On optimal linear codes over \(\mathbb F_5\)
DOI10.1016/j.disc.2008.01.047zbMath1171.94011OpenAlexW2064007968MaRDI QIDQ1024432
Ayako Kikui, Tatsuya Maruta, Maori Shinohara
Publication date: 17 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.047
arcbounds on codesfinite projective geometryblocking setminihyperextension of a linear codemain coding theory problemoptimal linear code
Linear codes (general theory) (94B05) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Linear codes and caps in Galois spaces (51E22) Combinatorial aspects of finite geometries (05B25) Blocking sets, ovals, (k)-arcs (51E21)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extension theorems for linear codes over finite fields
- A characterization of \(\{ 2\upsilon{}_{\alpha{}+1}+2\upsilon{}_{\beta{}+1},2\upsilon_ \alpha{}+2\upsilon{}_ \beta{} ;t,q\}\)-minihypers in PG\((t,q)(t\geq 2,q\geq 5\) and \(0\leq\alpha{}<\beta{}<t)\) and its applications to error- correcting codes
- Divisibility of codes meeting the Griesmer bound
- On the minimum length of \(q\)-ary linear codes of dimension five
- On optimal codes over the field with five elements
- Some new results on optimal codes over \(\mathbb F_5\)
- On the minimum size of some minihypers and related linear codes
- A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry]
- New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4)
- An extension theorem for linear codes
- On optimal non-projective ternary linear codes
- On the minimum length of some linear codes of dimension 5
- Classification of maximal caps in PG(3,5) different from elliptic quadrics
- A new extension theorem for linear codes
- The smallest length of eight-dimensional binary linear codes with prescribed minimum distance
- Algebraically punctured cyclic codes
- A Bound for Error-Correcting Codes
- On the nonexistence of \(q\)-ary linear codes of dimension five
This page was built for publication: On optimal linear codes over \(\mathbb F_5\)