Hasse-Weil bound for additive cyclic codes

Abstract

We obtain a bound on the minimum distance of additive cyclic codes via number of rational points on certain algebraic curves over nite elds. 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 and provide examples where it yields better results