Optimization of Generalized Unary Coding
Discrete Mathematics
2016-11-11 v1
Abstract
This paper proposes an optimum version of the recently advanced scheme for generalized unary coding. In this method, the block of 1s that identifies the number is allowed to be broken up, which extends the count. The result is established by a theorem. The number count is now n(n-k-1)+1 rather than the previously described (n-k)(n-k)-1.
Keywords
Cite
@article{arxiv.1611.03353,
title = {Optimization of Generalized Unary Coding},
author = {Rakshitha Ravula},
journal= {arXiv preprint arXiv:1611.03353},
year = {2016}
}
Comments
7 pages, 2 figures