Abstract

Let x∈Rx \in \R be given. As we know the, amount of bits needed to binary code xx with given accuracy (h∈Rh \in \R) is approximately $ \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 a∈Ra \in \R such that $$ \R \ni a \to \mathrm{E} (\m_{h} (X-a)) $$ attains minimum.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.