nach oben

Designs, Codes and Cryptography

Erschienen in:

26.03.2016

Hasse–Weil bound for additive cyclic codes

verfasst von: Cem Güneri, Ferruh Özbudak, Funda Özdemir

Erschienen in: Designs, Codes and Cryptography | Ausgabe 1-2/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

We obtain a bound on the minimum distance of additive cyclic codes via the number of rational points on certain algebraic curves over finite fields. This is an extension of the analogous bound in the case of classical cyclic codes. Our result is the only general bound on such codes aside from Bierbrauer’s BCH bound. We compare our bounds’ performance against the BCH bound for additive cyclic codes in a special case and provide examples where it yields better results.

Vorheriger Artikel Almost cover-free codes and designs

Nächster Artikel Idempotent and p-potent quadratic functions: distribution of nonlinearity and co-dimension

Bosma W., Cannon J., Playoust, C.: The magma algebra system I. The user language. J. Symb. Comput. 24, 235–265 (1997).

Bierbrauer J.: The theory of cyclic codes and a generalization to additive codes. Des. Codes Cryptogr. 25, 189–206 (2002).

Bierbrauer J.: Introduction to Coding Theory. Chapman and Hall/CRC Press, Boca Raton (2005).

Bierbrauer J., Edel Y.: Quantum twisted codes. J. Comb. Des. 8, 174–188 (2000).

Garcia A., Özbudak F.: Some maximal function fields and additive polynomials. Commun. Algebra 35, 1553–1566 (2007).

Güneri C., Özbudak F.: Weil-Serre type bounds for cyclic codes. IEEE Trans. Inf. Theory 54, 5381–5395 (2008).

Stichtenoth H.: Algebraic Function Fields and Codes. Springer GTM, New York 254, (2009).

Wolfmann, J.: New bounds on cyclic codes from algebraic curves. Coding Theory and Applications (Toulon, 1988). Lecture Notes in Computer Science. vol. 388, pp. 47–62 (1989).

Titel: Hasse–Weil bound for additive cyclic codes
verfasst von: Cem Güneri
Ferruh Özbudak
Funda Özdemir
Publikationsdatum: 26.03.2016
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 1-2/2017
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-016-0198-3

Springer Professional

Abstract

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

Weitere Artikel der Ausgabe 1-2/2017

Cover-free codes and separating system codes

Antiderivative functions over

Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity

Improved elliptic curve hashing and point representation

Redefining the transparency order

Improving algebraic attacks on stream ciphers based on linear feedback shift register over