2016/10/31 by Rakshitha Ravula, Ravula, Rakshitha
Computer Science · #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #cs.DM
paper · pdf · doi:10.48550/arxiv.1611.03353
7 pages, 2 figures
arxiv created 2016/10/31 · arxiv updated 2016/11/11
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.