Декодування циклічних кодів для каналів зв’язку зі стиранням

Abstract

The automaton models of cyclic codes based on commutative ring with the help of theory of linear finite-state machine (LFSM) are offered. The algorithm of linear complexity for the correction of random erasure in combination with random errors is suggested. The algorithm for the correction of the full burst erasures of length (n-k) with using Reed-Solomon codes is considered.