Skip to main content
main-content

Tipp

Weitere Artikel dieser Ausgabe durch Wischen aufrufen

26.03.2016 | Ausgabe 1-2/2017

Designs, Codes and Cryptography 1-2/2017

Hasse–Weil bound for additive cyclic codes

Zeitschrift:
Designs, Codes and Cryptography > Ausgabe 1-2/2017
Autoren:
Cem Güneri, Ferruh Özbudak, Funda Özdemir
Wichtige Hinweise
This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Coding and Cryptography”.

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.

Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten

Literatur
Über diesen Artikel

Weitere Artikel der Ausgabe 1-2/2017

Designs, Codes and Cryptography 1-2/2017 Zur Ausgabe

Premium Partner

    Bildnachweise