Universal probability assignment in the class of two-sided geometric distributions

Universal lossless coding is studied for memoryless, off-centered, two-sided geometrically distributed sources. We present a universal, sequential probability assignment scheme, which essentially attains the lower bound on the redundancy for this model.