A comparison between Suzuki invariant code and one-point Hermitian code

In this paper we compare the performance of two algebraic geometry codes (Suzuki and Hermitian codes) constructed using maximal algebraic curves over [Formula: see text] with large automorphism groups by choosing specific divisors. We discuss their parameters, compare the rate of these codes as well as their relative minimum distances, and we show that both codes are asymptotically good in terms of the rate which is in contrast to their behavior in terms of the relative minimum distance.