Fast erasure-and-error decoding of any one-point AG codes up to the Feng-Rao bound
Shojiro Sakata · 2002
Fast decoding methods of algebraic-geometric (AG) codes have been proposed as applications of Sakata's (1988) algorithm (the multidimensional Berlekamp-Massey algorithm). To improve the probability of correct decoding, it is desirable to devise an efficient decoding algorithm which can correct both errors and erasures. Skorobogatov and Vladut (1990) were the pioneers of erasure-and-error decoding of AG codes. Extending their error-only decoding method, Feng and Rao (see Proceedings of 1993 IEEE Information Theory Workshop, Shizuoka, Japan, June, 1993) gave an erasure-and-error decoding method which can correct t errors and /spl tau/ erasures such that 2t+/spl tau/