• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.83-98
• /
• 2014

We reformulate an interpolation-based unique decoding algorithm of AG codes, using the theory of Gr$\ddot{o}$bner bases of modules on the coordinate ring of the base curve. The conceptual description of the reformulated algorithm lets us better understand the majority voting procedure, which is central in the interpolation-based unique decoding. Moreover the smaller Gr$\ddot{o}$bner bases imply smaller space and time complexity of the algorithm.

• Honam Mathematical Journal
• /
• v.35 no.4
• /
• pp.793-808
• /
• 2013

An interpolation-based unique decoding algorithm of Algebraic Geometry codes was recently introduced. The algorithm iteratively computes the sent message through a majority voting procedure using the Gr$\ddot{o}$bner bases of interpolation modules. We now combine the main idea of the Guruswami-Sudan list decoding with the algorithm, and thus obtain a hybrid unique decoding algorithm of plane AG codes, significantly improving the decoding speed.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.6
• /
• pp.1015-1027
• /
• 2009

Many problems of confounding and identifiability for polynomial models in an experimental design can be solved using methods of algebraic geometry. The theory of $Gr\ddot{o}bner$ basis is used to characterize the design. In addition, a fractional factorial design can be uniquely represented by a polynomial indicator function. $Gr\ddot{o}bner$ bases and indicator functions are powerful computational tools to deal with ideals of fractions based on each different theoretical aspects. The problem posed here is to give how to move from one representation to the other. For a given fractional factorial design, the indicator function can be computed from the generating equations in the $Gr\ddot{o}bner$ basis. The theory is tested using some fractional factorial designs aided by a modern computational algebra package CoCoA.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.1
• /
• pp.13-29
• /
• 2007

In this paper, we first present a method for finding the implicit equation of the curve given by rational parametric equations. The method is based on the computation of $Gr\"{o}bner$ bases. Then, another method for implicitization of curve and surface is given. In the case of rational curves, the method proceeds via giving the implicit polynomial f with indeterminate coefficients, substituting the rational expressions for the given curve and surface into the implicit polynomial to yield a rational expression $\frac{g}{h}$ in the parameters. Equating coefficients of g in terms of parameters to 0 to get a system of linear equations in the indeterminate coefficients of polynomial f, and finally solving the linear system, we get all the coefficients of f, and thus we obtain the corresponding implicit equation. In the case of polynomial surfaces, we can similarly as in the case of rational curves obtain its implicit equation. This method is based on characteristic set theory. Some examples will show that our methods are efficient.