Channels with memory and algebraic coding of Rida-Solomon codes

The article is devoted to the algebraic coding of Reed-Solomon codes. This article discusses decoding based on interpolation, which is used to develop an effective algorithm for decoding an algorithm for Reed-Solomon solutions. The focus of this article is the performance achieved in a probabilistic setup, where the channel output is characterized by a posteriori probabilities rather than errors. The asymptotic characteristics of the proposed soft decoding algorithm for a large number of interpolation points or, what is the same, for large lists were characterized in terms of simple geometric conditions.