Skip to main content
Log in

A class of quaternary linear codes improving known minimum distances

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

Abstract

For a triple \((F,K,E)\) of finite fields with characteristic \(p\) and with \(K\) an intermediate field of \(E/F\), we describe the \(F\)-vector space of all mappings from \(E\) to \(F\) which are constant on \(K\)-conjugate classes by means of a certain basis. Based on this description, constructions of codes together with an analysis of their designed minimum distances are provided when (a) \(E=K\), or when (b) \([E:K]=p\) and \([K:F]\) is a power of \(p\). An application to the quaternary field \(F=\mathbb {F}_4\) yields a lot of good codes in (a), and in (b) even more than 50 codes which improve the currently best known minimum distances as available from codetables.de (Grassl in Code Tables: Bounds on the Parameters of Various Types of Codes, www.iks.kit.edu/home/grassl/codetables/, 2014).

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ding Y., Jin L., Xing C.: Good linear codes from polynomial evaluations. IEEE Trans. Commun. 60, 357–363 (2012).

  2. Grassl M.: Code Tables: Bounds on the Parameters of Various Types of Codes. www.iks.kit.edu/home/grassl/codetables/ (2014). Accessed 25 June 2014.

  3. Li Y., Chen W.: On the construction of some optimal polynomial codes. In: Hao Y., et al. (eds.) Computational Intelligence and Security, 2005, LNAI vol. 3802, pp. 74–79. Springer, Berlin (2005).

  4. Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1997).

  5. Ling S., Niederreiter H., Xing C.: Symmetric polynomials and some good codes. Finite Fields Appl. 7, 142–148 (2001).

  6. Sage, Free Open-Source Mathematics Software System. http://www.sagemath.org/. Accessed 25 June 2014.

  7. Xing C., Fang Y.: A class of polynomial codes. IEEE Trans. Inf. Theory 50, 884–887 (2004).

  8. Xing C., Ling S.: A class of linear codes with good parameters. IEEE Trans. Inf. Theory 46, 2184–2188 (2000).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dirk Hachenberger.

Additional information

Communicated by A. Winterhof.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Steinbach, M., Hachenberger, D. A class of quaternary linear codes improving known minimum distances. Des. Codes Cryptogr. 78, 615–627 (2016). https://doi.org/10.1007/s10623-014-0021-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-014-0021-y

Keywords

Mathematics Subject Classification

Navigation