Abstract
Binary error-correction encoding using the two-base numeration system with the radices 2 and 3 is proposed. Properties and error-correcting capabilities of such codes for one and two errors are analyzed. A special kind of the (2, 3) code, namely, the lower (2, 3) code is introduced to provide error-correcting properties.
Similar content being viewed by others
References
A. V. Anisimov, “Integer representation in the mixed base (2, 3),” Cybernetics and Systems Analysis, 45, No. 4, 503–516 (2009).
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, “Two-base numeration systems,” Cybernetics and Systems Analysis, 49, No. 4, 501–510 (2013).
P. Elias, “Universal codeword sets and representations of the integers," IEEE Trans. Inform. Theory, 21, No. 2, 194–203 (1976).
V. I. Levenshtein, “Redundancy and delay of decodable coding of natural numbers,” Problems of Cybernetics, 20, 173–179 (1968).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 3–16, March–April, 2014.
Rights and permissions
About this article
Cite this article
Anisimov, A.V., Zavadsky, I.A. Robust Prefix Encoding Using Lower (2,3) Number Representation. Cybern Syst Anal 50, 163–175 (2014). https://doi.org/10.1007/s10559-014-9604-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-014-9604-x