Efficient computation of zero-dimensional Gro¨bner bases by change of ordering
Journal of Symbolic Computation
IEEE Transactions on Information Theory - Part 1
IEEE Transactions on Information Theory
Finding the defining functions for one-point algebraic-geometry codes
IEEE Transactions on Information Theory
A simple approach for construction of algebraic-geometric codes from affine plane curves
IEEE Transactions on Information Theory
On the Structure of Order Domains
Finite Fields and Their Applications
Journal of Symbolic Computation
Finite Fields and Their Applications
Parallel algorithms for normalization
Journal of Symbolic Computation
Hi-index | 0.00 |
Curves and surfaces of type I are generalized to integral towers of rank r. Weight functions with values in N^r and the corresponding weighted total-degree monomial orderings lift naturally from one domain R"j"-"1 in the tower to the next, R"j, the integral closure of R"j"-"1[x"j]/. The qth power algorithm is reworked in this more general setting to produce this integral closure over finite fields, though the application is primarily that of calculating the normalizations of curves related to one-point AG codes arising from towers of function fields. Every attempt has been made to couch all the theory in terms of multivariate polynomial rings and ideals instead of the terminology from algebraic geometry or function field theory, and to avoid the use of any type of series expansion.