Lossless compression is studied for pairs of independent integer-valued symbols emitted by a source with a geometric probability distribution of parameter q ∊? (0, 1). Optimal prefix codes are described for q = 1/2k (k > 1) and q = 1/ k√?2 (k > 0). The codes described differ from previously characterized cases related to the geometric distribution in that their corresponding trees are of unbounded width, and in that an infinite set of distinct optimal codes is required to cover any interval (0, ?), ? > 0, of values of q.