Hasse-Weil Bound for Additive Cyclic Codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Hasse-Weil Bound for Additive Cyclic Codes


We obtain a bound on the minimum distance of additive cyclic codes via 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 seems to be the only general bound on such codes aside from Bierbrauer's BCH bound.
Fichier principal
Vignette du fichier
wcc15-mo3-1.pdf (253.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01275733 , version 1 (18-02-2016)


  • HAL Id : hal-01275733 , version 1


Cem Güneri, Ferruh Özbudak, Fundä Ozdemir. Hasse-Weil Bound for Additive Cyclic Codes. WCC2015 - 9th International Workshop on Coding and Cryptography 2015, Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia, Apr 2015, Paris, France. ⟨hal-01275733⟩


30 View
204 Download


Gmail Facebook Twitter LinkedIn More