Abstract
We give a generalization of error-correcting code construction from curves by working with towers of algebraic function fields. The towers are constructed recursively, using defining equations of curves. In order to estimate the parameters of the corresponding one-point Goppa codes, one needs to calculate the genus. Instead of using the Hurwitz genus formula, for which one needs to know about ramification behavior, we use the Riemann-Roch theorem to get an upper bound for the genus by counting the number of Weierstrass gap numbers associated to a particular divisor. We provide a family of examples of towers which meet the bound.
Acknowledgments
I would like to thank Emma Previato for encouragement and many useful conversations. This work was supported by NSF grant DMS-0205643.
Citation
Caleb Mckinley Shor. "GENUS CALCULATIONS FOR TOWERS OF FUNCTION FIELDS ARISING FROM EQUATIONS OF CURVES." Albanian J. Math. 5 (1) 31 - 40, 2011. https://doi.org/10.51286/albjm/1300195228
Information