pith. sign in

arxiv: 1502.00894 · v1 · pith:SGNUJGYBnew · submitted 2015-02-03 · 💻 cs.IT · math.IT

Extended Unary Coding

classification 💻 cs.IT math.IT
keywords codingspreadunaryextendednumbersschemesallowapproximately
0
0 comments X
read the original abstract

Extended variants of the recently introduced spread unary coding are described. These schemes, in which the length of the code word is fixed, allow representation of approximately n^2 numbers for n bits, rather than the n numbers of the standard unary coding. In the first of two proposed schemes the spread increases, whereas in the second scheme the spread remains constant.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.