English

The memory centre

Information Theory 2012-04-03 v1 math.IT

Abstract

Let xRx \in \R be given. As we know the, amount of bits needed to binary code xx with given accuracy (hRh \in \R) is approximately \mh(x)log2(max1,xh). \m_{h}(x) \approx \log_{2}(\max {1, |\frac{x}{h}|}). We consider the problem where we should translate the origin aa so that the mean amount of bits needed to code randomly chosen element from a realization of a random variable XX is minimal. In other words, we want to find aRa \in \R such that RaE(\mh(Xa)) \R \ni a \to \mathrm{E} (\m_{h} (X-a)) attains minimum.

Cite

@article{arxiv.1204.0281,
  title  = {The memory centre},
  author = {Przemysław Spurek and Jacek Tabor},
  journal= {arXiv preprint arXiv:1204.0281},
  year   = {2012}
}
R2 v1 2026-06-21T20:43:12.200Z