The memory centre

TL;DR

This paper investigates how to optimally translate the origin to minimize the expected number of bits needed to encode a random variable with a given accuracy, linking coding length to location shifts.

Contribution

It introduces a problem of translating the origin to minimize average coding length for a random variable, providing a new perspective on data encoding efficiency.

Findings

Optimal translation minimizes expected coding bits.

The problem relates to location estimation and coding efficiency.

Provides a framework for minimal coding length through origin translation.

Abstract

Let $x \in \R$ be given. As we know the, amount of bits needed to binary code $x$ with given accuracy ($h \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 $a$ so that the mean amount of bits needed to code randomly chosen element from a realization of a random variable $X$ is minimal. In other words, we want to find $a \in \R$ such that $$ \R \ni a \to \mathrm{E} (\m_{h} (X-a)) $$ attains minimum.