  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.
