FAST UNIQUE DECODING OF PLANE AG CODES

• Journal title : Honam Mathematical Journal
• Volume 35, Issue 4,  2013, pp.793-808
• Publisher : The Honam Mathematical Society
• DOI : 10.5831/HMJ.2013.35.4.793
Title & Authors
FAST UNIQUE DECODING OF PLANE AG CODES
Lee, Kwankyu;

Abstract
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$\small{\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.
Keywords
algebraic geometry codes;interpolation decoding;Gr$\small{\ddot{o}}$bner bases;
Language
English
Cited by
References
1.
M. F. Atiyah and I. G. MacDonald, Introduction to Commutative Algebra, Perseus Books, 1969.

2.
D. Eisenbud, Commutative Algebra with a View toward Algebraic Geometry, Number 150 in GTM, Springer-Verlag, 1995.

3.
K. Lee, Unique decoding of plane AG codes revisited, arXiv, Apr. 2012. arXiv:1204.0052v2.

4.
K. Lee, M. Bras-Amoros, and M. E. O'Sullivan, Unique decoding of plane AG codes via interpolation, IEEE Trans. Inf. Theory, 58(6) (2012), 3941-3950.

5.
K. Lee and M. E. O'Sullivan, List decoding of Hermitian codes using Grobner bases, Journal of Symbolic Computation, 44 (2009), 1662-1675.

6.
J. C. Rosales and P. A. Garca-Sanchez, Numerical semigroups, volume 20 of Developments in Mathematics, Springer, New York, 2009.

7.
R. M. Roth and G. Ruckenstein, Ecient decoding of Reed-Solomon codes beyond half the minimum distance, IEEE Trans. Inf. Theory, 46(1) (2000), 246-257.

8.
W. A. Stein et al, Sage Mathematics Software (Version 4.8), The Sage Development Team, 2012. http://www.sagemath.org