On optimal linear codes over \(\mathbb F_5\)

DOI10.1016/j.disc.2008.01.047zbMath1171.94011MaRDI 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

zbMATH Keywords

arc; bounds on codes; finite projective geometry; blocking set; minihyper; extension of a linear code; main coding theory problem; optimal linear code

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

94B65: Bounds on codes

94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory

51E22: Linear codes and caps in Galois spaces

05B25: Combinatorial aspects of finite geometries

51E21: Blocking sets, ovals, (k)-arcs

Related Items

On the minimum length of linear codes over the field of 9 elements, Extendability of 3-weight (mod \(q\)) linear codes over \(\mathbb F_q\), On the minimum length of linear codes over \(\mathbb{F}_5\), On multiple caps in finite projective spaces

Uses Software

• MinT

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