Translator Disclaimer
2005 Codes for the World Wide Web
Paolo Boldi, Sebastiano Vigna
Internet Math. 2(4): 407-429 (2005).

Abstract

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

Citation

Download Citation

Paolo Boldi. Sebastiano Vigna. "Codes for the World Wide Web." Internet Math. 2 (4) 407 - 429, 2005.

Information

Published: 2005
First available in Project Euclid: 16 June 2006

zbMATH: 1101.94013
MathSciNet: MR2241755

Rights: Copyright © 2005 A K Peters, Ltd.

JOURNAL ARTICLE
23 PAGES


SHARE
Vol.2 • No. 4 • 2005
Back to Top