Integer representation in the mixed base \((2,3)\)
From MaRDI portal
Publication:1040415
DOI10.1007/s10559-009-9119-zzbMath1185.68015OpenAlexW1992445434MaRDI QIDQ1040415
Publication date: 24 November 2009
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-009-9119-z
Related Items (3)
Some remarks about the Collatz problem ⋮ Two-base numeration systems ⋮ Robust prefix encoding using lower \((2,3)\) number representation
Cites Work
- Data coding by linear forms of numerical sequences
- An almost optimal algorithm for unbounded searching
- Fibonacci linear forms and parallel arithmetic algorithms for large numbers
- Robust transmission of unbounded strings using Fibonacci representations
- Modular Multiplication Without Trial Division
- Inverse fibonacci transformation
- Improved prefix encodings of the natural numbers (Corresp.)
- Universal codeword sets and representations of the integers
- Economical encoding of commas between strings
- Universal coding of integers and unbounded search trees
- A new recursive universal code of the positive integers
This page was built for publication: Integer representation in the mixed base \((2,3)\)
