A Code Whose Codeword Length is Shorter than log2* n in Almost All of Sufficiently Large Positive Integers
H. NAKAMURA · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2006
A recursive-type positive integer code is proposed. It prefixes the information about the length of the component of the codeword recursively. It is an asymptotically optimal code. The codeword length for a positive integer n is shorter than log2*n bits in almost all of sufficiently large positive integers, where log2*n is the log-star function.