Теорія циклічних кодів на основі автоматних моделей

Abstract

The automaton models of cyclic codes which based on theory of linear finite-state machine (LFSM) are offered. The systematic and nonsystematic encoding of cyclic codes with the help of a recursive, a nonrecursive and a combined LFSM are considered. The automaton-graphical methods of decoding of linear and polynomial complexity are suggested for the different types of errors: the random errors, burst errors and erasures. The increasing of the performance of encoding and decoding procedures based on parallel processing are shown. New characteristics of correcting capability of cyclic codes which based on their automaton models are introduced. New characteristics of correcting capability of cyclic codes based their automaton models is introduced. The features of BCH codes, Reed‐Solomon codes, Fire codes and Abramson codes are considered and parallel cyclic codes are offered.