Skip to main content
SpringerLink
Log in

On the construction of Griesmer codes of dimension 5

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

We construct Griesmer \([n,5,d]_q\) codes for \(2q^4+1 \le d \le 2q^4+q^2-q\) using some geometric methods such as projective dual and geometric puncturing.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Brouwer A.E., van Eupen M.: The correspondence between projective codes and 2-weight codes. Des. Codes Cryptogr. 11, 261–266 (1997).

    Google Scholar 

  2. Cheon E.J., Kato T., Kim S.J.: On the minimum length of some linear codes of dimension 5. Des. Codes Cryptogr. 37, 421–434 (2005).

    Google Scholar 

  3. Grassl M.: Tables of linear codes and quantum codes (electronic table, online). http://www.codetables.de/. Accessed 6 Nov 2013.

  4. Hill R.: Optimal linear codes. In: Mitchell C. (ed.) Cryptography and Coding II, pp. 75–104. Oxford University Press, Oxford (1992).

  5. Hill R., Kolev E.: A survey of recent results on optimal linear codes. In: Holroyd F.C. et al. (eds.) Combinatorial Designs and Their Applications. Chapman and Hall/CRC Press Research Notes in Mathematics, pp. 127–152. CRC Press, Boca Raton (1999).

  6. Hill R., Newton D.E.: Optimal ternary linear codes. Des. Codes Cryptogr. 2, 137–157 (1992).

    Google Scholar 

  7. Hirschfeld J.W.P.: Projective Geometries Over Finite Fields, 2nd edn. Clarendon Press, Oxford (1998).

  8. Hirschfeld J.W.P., Thas J.A.: General Galois Geometries. Clarendon Press, Oxford (1991).

  9. Kohnert A.: Best linear codes. http://www.algorithm.uni-bayreuth.de/en/research/Coding_Theory/Linear_Codes_BKW/index.html. Accessed 6 Nov 2013.

  10. Maruta T.: On the nonexistence of \(q\)-ary linear codes of dimension five. Des. Codes Cryptogr. 22, 165–177 (2001).

  11. Maruta T.: Construction of optimal linear codes by geometric puncturing. Serdica J. Comput. 7, 73–80 (2013).

    Google Scholar 

  12. Maruta T.: Griesmer bound for linear codes over finite fields. http://www.geocities.jp/mars39geo/griesmer.htm. Accessed 6 Nov 2013.

  13. Maruta T., Oya Y.: On optimal ternary linear codes of dimension 6. Adv. Math. Commun. 5, 505–520 (2011).

    Google Scholar 

  14. Takenaka M., Okamoto K., Maruta T.: On optimal non-projective ternary linear codes. Discret. Math. 308, 842–854 (2008).

    Google Scholar 

Download references

Acknowledgments

The authors would like to thank the anonymous referees for their careful reading and valuable suggestions. This research was partially supported by Grant-in-Aid for Scientific Research of Japan Society for the Promotion of Science under Contract Number 24540138.

Author information

Authors and Affiliations

  1. Department of Mathematics and Information Sciences, Osaka Prefecture University, Sakai, 599-8531, Osaka, Japan

    Yuuki Kageyama & Tatsuya Maruta

Authors
  1. Yuuki Kageyama
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tatsuya Maruta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tatsuya Maruta.

Additional information

Communicated by R. Hill.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kageyama, Y., Maruta, T. On the construction of Griesmer codes of dimension 5. Des. Codes Cryptogr. 75, 277–280 (2015). https://doi.org/10.1007/s10623-013-9914-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-013-9914-4

Keywords

Mathematics Subject Classification

Search

Navigation