A code whose codeword length is shorter than log*(2) n in almost all of sufficiently large positive integers
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 log(2)* n is the log-star function.
recursive-type positive integer code asymptotically optimal code length information log-star junction universality