摘要: We introduce a new family of simple, complete instantaneous codes for positive integers, called ζ codes, which are suitable integers distributed as power law with small exponent (smaller than 2). The main motivation the introduction comes from web-graph compression: if nodes numbered according to URL lexicographical order, gaps in successor lists exponent. give estimates expected length against power-law distributions, and compare results analogous more classical γ, δ variable-length block codes.