Hasse-Weil Bound for Additive Cyclic Codes
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...