Abstract
A new method for error-correcting coding is proposed. It is based on processing information messages by finite automata and using a two-base numeral system. The two-level structure of an encoder provides powerful error-correcting capabilities. On the first (internal) level, an input message is considered as a binary number represented as a lower (2,3) code that has some redundancy and error-correcting properties. The noise-resistant properties are strengthened on the external level where the code is processed by a special finite automaton. It is a variable-length code, i.e., the codeword length depends not only on the length of an input message but also on the message content. However, the average code rate equals 1/2.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. V. Anisimov, “Prefix encoding by means of the 2,3-representation of numbers,” IEEE Trans. Inform. Theory, 59, No. 4, 2359–2374 (2013).
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).
A. V. Anisimov and I. O. Zavadskyi, “Forward error correcting codes by means of the two-base (2,3)-numeration system,” in: IEEE Intern. Black Sea Conf. on Communications and Networking, Chisinau (2014), pp. 107–111.
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 43–51, March–April, 2015.
Rights and permissions
About this article
Cite this article
Zavadskyi, I.O. Variable-Length Error-Correcting Codes Based on Finite Automata. Cybern Syst Anal 51, 198–204 (2015). https://doi.org/10.1007/s10559-015-9712-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-015-9712-2