ar X iv : c s / 06 11 07 3 v 1 [ cs . I T ] 1 5 N ov 2 00 6 Efficient Coding of Integers for Certain Probability Distributions

@inproceedings{Baer2006arXI,
  title={ar X iv : c s / 06 11 07 3 v 1 [ cs . I T ] 1 5 N ov 2 00 6 Efficient Coding of Integers for Certain Probability Distributions},
  author={Michael B. Baer and Michael. Baer},
  year={2006}
}
Methods for prefix coding integers generally either consider specific distributions that decline more quickly t han a power law (for Golomb-like codes) or simultaneously consid er all finite-entropy distributions (for universal codes). Particular power-law and similar distributions, however, are often known to model particular random variables. Codes for… CONTINUE READING