nach oben

Designs, Codes and Cryptography

Erschienen in:

10.08.2016

Linear codes with few weights from inhomogeneous quadratic functions

verfasst von: Chunming Tang, Can Xiang, Keqin Feng

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

Einloggen, um Zugang zu erhalten

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

search-config

KI-gestützte Suche

Aus

Abstract

Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes with few weights are constructed from inhomogeneous quadratic functions over the finite field \({\mathrm {GF}}(p)\), where p is an odd prime. They include some earlier linear codes as special cases. The weight distributions of these linear codes are also determined.

Vorheriger Artikel Proof of a conjecture of Kløve on permutation codes under the Chebychev distance

Nächster Artikel Editor’s note

Calderbank A.R., Goethals J.M.: Three-weight codes and association schemes. Philips J. Res. 39, 143–152 (1984).

Calderbank A.R., Kantor W.M.: The geometry of two-weight codes. Bull. Lond. Math. Soc. 18, 97–122 (1986).

Carlet C., Ding C., Yuan J.: Linear codes from perfect nonlinear mappings and their secret sharing schemes. IEEE Trans. Inf. Theory 51(6), 2089–2102 (2005).

Ding C.: Linear codes from some 2-designs. IEEE Trans. Inf. Theory 61(6), 3265–3275 (2015).

Ding C.: A construction of binary linear codes from Boolean functions. Discret. Math. 339(9), 2288–2303 (2016).

Ding K., Ding C.: Binary linear codes with three weights. IEEE Commun. Lett. 18(11), 1879–1882 (2014).

Ding K., Ding C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory 61(11), 5835–5842 (2015).

Ding C., Wang X.: A coding theory construction of new systematic authentication codes. Theor. Comput. Sci. 330, 81–99 (2005).

Ding C., Yang J.: Hamming weights in irreducible cyclic codes. Discret. Math. 313(4), 434–446 (2013).

10.

Ding C., Helleseth T., Klove T., Wang X.: A generic construction of Cartesian authen- tication codes. IEEE Trans. Inf. Theory 53(6), 2229–2235 (2007).

11.

Ding C., Liu Y., Ma C., Zeng L.: The weight distribution of the duals of cyclic codes with two zeros. IEEE Trans. Inf. Theory 57(12), 8000–8006 (2011).

12.

Feng K., Luo J.: Value distribution of exponential sums from perfect nonlinear functions and their applications. IEEE Trans. Inf. Theory 53(9), 3035–3041 (2007).

13.

Ireland K., Rosen M.: A classical introduction to modern number theory. In: Graduate Texts in Mathematics, vol. 84, 2nd edn. Springer, New York (1990).

14.

Klve T.: Codes for Error Detection. World Scientific, Hackensack (2007).

15.

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

16.

Li F., Wang Q., Lin D.: A class of three-weight and five-weightlinear codes, arXiv:1509.06242v1 (2015).

17.

Mesnager S.: Linear codes with few weights from weakly regular bent functions based on a generic construction. IACR Cryptol. 2015, 1103 (2015).

18.

Qi Y., Tang C., Huang D.: Binary linear codes with few weights. IEEE Commun. Lett. 20(2), 208–211 (2016).

19.

Tang C., Li N., Qi Y., Zhou Z., Helleseth T.: Two-weight and three-weight linear codes from weakly regular bent functions. IEEE Trans. Inf. Theory 62(3), 1166–1176 (2016).

20.

Tang C., Qi Y., Huang D.: Two-weight and three-weight linear codes from square functions. IEEE Commun. Lett. 20(1), 29–32 (2016).

21.

Xiang C., Tang C., Feng K.: A class of linear codes with a few weights, arXiv:1512.07103v1 (2015).

22.

Zhou Z., Li N., Fan C., Helleseth T.: Linear codes with two or three weights from quadratic bent functions, Des. Codes Cryptogr. 1–13 (2015).

Titel: Linear codes with few weights from inhomogeneous quadratic functions
verfasst von: Chunming Tang
Can Xiang
Keqin Feng
Publikationsdatum: 10.08.2016
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 3/2017
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-016-0267-7

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 3/2017

Twofold triple systems without 2-intersecting Gray codes

Construction of binary linear codes via rational function fields

Simple t-designs: a recursive construction for arbitrary t

The structure of the minimum size supertail of a subspace partition

Extending permutation arrays: improving MOLS bounds

An optimal representation for the trace zero subgroup