Two-base numeration systems

DOI10.1007/s10559-013-9535-yzbMath1298.68085OpenAlexW2007655044MaRDI QIDQ466398

Anatoly V. Anisimov

Publication date: 27 October 2014

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

Full work available at URL: https://doi.org/10.1007/s10559-013-9535-y

zbMATH Keywords

number systemsrecursionlinear formstreesprefix codesnumber coding

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Prefix, length-variable, comma-free codes (94A45)

Related Items (3)

Encoding trees by linear recurrence sequences ⋮ Generating \((2,3)\)-codes ⋮ Robust prefix encoding using lower \((2,3)\) number representation

Cites Work

• Integer representation in the mixed base \((2,3)\)
• Fibonacci linear forms and parallel arithmetic algorithms for large numbers
• Prefix Encoding by Means of the $(2,3)$-Representation of Numbers
• Robust transmission of unbounded strings using Fibonacci representations
• Inverse fibonacci transformation
• Universal codeword sets and representations of the integers
• Variable-length integer codes based on the Goldbach conjecture, and other additive codes
• A Method for the Construction of Minimum-Redundancy Codes
• Unnamed Item
• Unnamed Item

This page was built for publication: Two-base numeration systems