Abstract
We reformulate an interpolation-based unique decoding algorithm of AG codes, using the theory of Gr<TEX>$\ddot{o}$</TEX>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<TEX>$\ddot{o}$</TEX>bner bases imply smaller space and time complexity of the algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
