• Journal of applied mathematics & informatics
• /
• 제32권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.

• 호남수학학술지
• /
• 제35권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
• /
• 제20권6호
• /
• pp.1015-1027
• /
• 2009

대수기하학적 접근이란 실험계획에서의 공간 내의 점들 즉, 기하학적 대상인 다양체에 대한 문제를 다항식을 매개로 하여 아이디얼 즉, 대수적 문제로 전환하고자 한 것이라 할 수 있다. 지금까지의 연구는 완전요인실험으로부터 효율적인 부분요인실험을 선택하는 절차에 집중되어 왔다. 본 논문에서는 지금까지 연구 방법의 역의 과정을 추정해 보기로 한다. 한 부분요인실험이 선택되었을 때, 그 실험의 교락구조를 그뢰브너 기저를 구한 후 해석한다. 다음으로 그뢰브너 기저를 생성자로 활용하여 선택된 부분실험의 집합을 구별하기 위한 다항함수인 지시함수를 구하는 절차를 알아보기로 한다. 실제로 몇 가지 부분요인실험을 예로 택하여 그 과정을 수행하였다. 연산은 CoCoA 대수연산 소프트웨어를 이용하였다.

• 대한수학회보
• /
• 제44권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.