A type of recurring relations on sequences and efficient decodingof a class of algebraic-geometric codes

摘要

A type of recurring relation is introduced on sequences. Someproperties of this type of recurring relations are established and analgorithm for computing a minimal polynomial set of this type ofrecurring relation is presented. Then an efficient decoding algorithm upto half the Feng-Rao bound for a class of algebraic-geometric codes isproposed by developing a majority voting scheme of the recurringrelation on the syndrome sequence of an error vector