IEEE Transactions on Information Theory · 1995 · 76 citations · 10 references
EngineeringRepresentation TheoryAlgebraic-geometric CodesAlgebraic Coding TheoryError Correction CodeAlgebraic MethodIterative DecodingSakata AlgorithmComputational ComplexityComputer ScienceApplied AlgebraCoding TheoryBerlekamp-massey DecodingGeneral ClassVariable-length CodeFeng-rao Bound
We treat a general class of algebraic-geometric codes and show how to decode these up to half the Feng-Rao bound, using an extension and modification of the Sakata algorithm (1990). The Sakata algorithm is a generalization to N dimensions of the classical Berlekamp-Massey algorithm.
10
Shift-register synthesis and BCH decoding
J. Massey · IEEE Transactions on Information Theory · 1969 · 2.2K citations