Prefix Encoding by Means of the $(2,3)$-Representation of Numbers

DOI10.1109/TIT.2012.2233544zbMath1364.94742OpenAlexW2104759853MaRDI QIDQ2989323

Anatoly V. Anisimov

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2012.2233544

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other types of codes (94B60)

Related Items (5)

Encoding trees by linear recurrence sequences ⋮ Generating \((2,3)\)-codes ⋮ Two-base numeration systems ⋮ Robust prefix encoding using lower \((2,3)\) number representation ⋮ Variable-length error-correcting codes based on finite automata

This page was built for publication: Prefix Encoding by Means of the $(2,3)$-Representation of Numbers