Minimum Distance Decoding of General Algebraic Geometry Codes via Lists

2010 ◽  
Vol 56 (9) ◽  
pp. 4335-4340 ◽  
Author(s):  
Nathan Drake ◽  
Gretchen L. Matthews
Author(s):  
Abdulla Eid

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.


2009 ◽  
Vol 213 (1) ◽  
pp. 87-97 ◽  
Author(s):  
Cem Güneri ◽  
Henning Stichtenoth ◽  
İhsan Taşkın

2018 ◽  
Vol 86 (12) ◽  
pp. 2893-2916 ◽  
Author(s):  
José I. Farrán ◽  
Pedro A. García-Sánchez ◽  
Benjamín A. Heredia

Sign in / Sign up

Export Citation Format

Share Document