Алгоритм выбора кратности исправляемых искажений для кодирования информации с применением кодов Рида-Соломона

This paper deals with the probability analysis of unrecoverable errors in data frames, encoded with application of Reed-Solomon codes and transmitted over network. Error probability analysis for a single byte and data frame with a given number of bytes, and selection algorithm for multiplicity of correctable errors for given bit error probability, length of data frame, length of user data and upper limit for probability of unrecoverable error in data frame are also overviewed. Example of reasonableness assessment for application of Reed-Solomon codes and selection for the multiplicity of correctable errors are also provided.