pith. sign in

arxiv: cs/0702118 · v1 · submitted 2007-02-21 · 💻 cs.IT · math.IT

Interpolation-based Decoding of Alternant Codes

classification 💻 cs.IT math.IT
keywords decodingcodesalgorithmalternanttheoryafreshbasesclassical
0
0 comments X
read the original abstract

We formulate the classical decoding algorithm of alternant codes afresh based on interpolation as in Sudan's list decoding of Reed-Solomon codes, and thus get rid of the key equation and the linear recurring sequences in the theory. The result is a streamlined exposition of the decoding algorithm using a bit of the theory of Groebner bases of modules.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.