Abstract
A decoding algorithm for a special error-correcting code is considered and its efficiency is estimated. This code is obtained as a result of processing information messages by finite automata and using a two-base numeral system. A general encoding algorithm is also considered. Both encoding or decoding are performed by a two-level system in which an input message is represented as a lower (2,3) code at the internal level, and the error correcting capabilities of this code are strengthened owing to its transformation with the help of a special finite automaton at the external level. In decoding, errors are first detected and corrected at the external level, and then possible remaining errors are eliminated by an internal automaton. The relationship between the external level of the system being considered and convolutional codes is investigated and the advantages of the proposed method are shown.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. O. Zavadskyi, “Variable length error-correcting codes based on finite automata,” Cybernetics and Systems Analysis, 51, No. 2, 198–204 (2015).
A. V. Anisimov and I. A. Zavadsky, “Robust prefix encoding using lower (2,3) number representation,” Cybernetics and Systems Analysis, 50, No. 2, 163–175 (2014).
R. Johannesson and K. Zigangirov, Fundamentals of Convolutional Coding, IEEE Press, New York (1999).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 16–24, May–June, 2015.
Rights and permissions
About this article
Cite this article
Zavadskyi, I.O. A Method for Decoding a Variable-Rate Error-Correcting Code Based on Finite-State Automata. Cybern Syst Anal 51, 336–343 (2015). https://doi.org/10.1007/s10559-015-9726-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-015-9726-9