Errors and erasures correcting for doubly lengthened Reed-Solomon codes

摘要

It is easy to construct doubly lengthened Reed-Solomon (doubly lengthened RS) codes which is codes increased two information symbols of RS codes. In this paper, we describe a method to compute error location polynomial from Forney syndromes on errors and erasures correction based on the Berlekamp-Massey algorithm. Furthermore, we give errors and erasures decoding algorithm for doubly lengthened RS codes based on the Euclidean algorithm.