Abstract. The decoding algorithm for the special error-correcting code is discussed and its efficiency is estimated. The code is based on information processing by finite automata and using two-base numeral system. The general encoding algorithm is also considered. Either encoding or decoding is performed by a two-level system: the input message is represented as the lower (2,3)-code on the internal level and the error correcting capabilities of this code are strengthened on the external level by its conversion using a special finite automaton. First and foremost errors are corrected on the external level; otherwise, they are erased by the internal automaton. The relation between the external level of the discussed system and convolutional codes is considered and the advantages of the proposed method are shown.

Keywords: finite-state automaton, error-correcting code, (2,3)-code, convolutional code.