Robust prefix encoding using lower \((2,3)\) number representation

DOI10.1007/s10559-014-9604-xzbMath1342.94062OpenAlexW2066530944MaRDI QIDQ2263249

I. A. Zavadsky, Anatoly V. Anisimov

Publication date: 18 March 2015

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-014-9604-x

zbMATH Keywords

prefix codeerror correctionerror-correction encoding

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Source coding (94A29)

Related Items (3)

A method for decoding a variable-rate error-correcting code based on finite-state automata ⋮ Generating \((2,3)\)-codes ⋮ Variable-length error-correcting codes based on finite automata

Cites Work

• Two-base numeration systems
• Integer representation in the mixed base \((2,3)\)
• Prefix Encoding by Means of the $(2,3)$-Representation of Numbers
• Universal codeword sets and representations of the integers

This page was built for publication: Robust prefix encoding using lower \((2,3)\) number representation