The simplified algorithm of decoding of the code of Read-Solomon
The simplified algorithm of decoding of a code of Read-Solomon in the limits guaranteed by half of the minimum code distance is offered. The algorithm of decoding is based on the theory of Pade approximations and uses recurrent parities between Gankel determinants, made of a component of a syndrome of errors. Estimations of complexity of algorithm are given. Examples of decoding of a code of Read-Solomon are considered.