Skip to main content
Erschienen in: Designs, Codes and Cryptography 3/2016

01.03.2016

A class of quaternary linear codes improving known minimum distances

verfasst von: Martin Steinbach, Dirk Hachenberger

Erschienen in: Designs, Codes and Cryptography | Ausgabe 3/2016

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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).
Literatur
1.
Zurück zum Zitat Ding Y., Jin L., Xing C.: Good linear codes from polynomial evaluations. IEEE Trans. Commun. 60, 357–363 (2012). Ding Y., Jin L., Xing C.: Good linear codes from polynomial evaluations. IEEE Trans. Commun. 60, 357–363 (2012).
3.
Zurück zum Zitat 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). 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.
Zurück zum Zitat Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1997). Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1997).
5.
Zurück zum Zitat Ling S., Niederreiter H., Xing C.: Symmetric polynomials and some good codes. Finite Fields Appl. 7, 142–148 (2001). Ling S., Niederreiter H., Xing C.: Symmetric polynomials and some good codes. Finite Fields Appl. 7, 142–148 (2001).
7.
Zurück zum Zitat Xing C., Fang Y.: A class of polynomial codes. IEEE Trans. Inf. Theory 50, 884–887 (2004). Xing C., Fang Y.: A class of polynomial codes. IEEE Trans. Inf. Theory 50, 884–887 (2004).
8.
Zurück zum Zitat Xing C., Ling S.: A class of linear codes with good parameters. IEEE Trans. Inf. Theory 46, 2184–2188 (2000). Xing C., Ling S.: A class of linear codes with good parameters. IEEE Trans. Inf. Theory 46, 2184–2188 (2000).
Metadaten
Titel
A class of quaternary linear codes improving known minimum distances
verfasst von
Martin Steinbach
Dirk Hachenberger
Publikationsdatum
01.03.2016
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 3/2016
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-014-0021-y

Weitere Artikel der Ausgabe 3/2016

Designs, Codes and Cryptography 3/2016 Zur Ausgabe