2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/222396In prefix coding over an infinite alphabet, methods that consider specific distributions generally consider those that decline more quickly than a power law (e.g., Golomb coding). Particular power-law distributions, however, model many random variables encountered in practice. For such random variables, compression performance is judged via estimates of expected bits per input symbol. This correspondence introduces a family of prefix codes with an eye towards near-optimal coding of known distributions. Compression performance is precisely estimated for well-known probability distributions using these codes and using previously known prefix codes. One application of these near-optimal codes is an improved representation of rational numbers.5 pages, 2 tables, submitted to Transactions on Information TheoryInformation TheoryE.4; H.1.1; I.2.8text