
Precise Expression for the Algorithmic Information Distance
We consider the notion of information distance between two objects x and...
read it

Universal codes in the sharedrandomness model for channels with general distortion capabilities
We put forth new models for universal channel coding. Unlike standard co...
read it

The normalized algorithmic information distance can not be approximated
It is known that the normalized algorithmic information distance N is no...
read it

Universal almost optimal compression and SlepianWolf coding in probabilistic polynomial time
In a lossless compression system with target lengths, a compressor C map...
read it

Information Distance Revisited
We consider the notion of information distance between two objects x and...
read it

Optimal probabilistic polynomial time compression and the SlepianWolf theorem: tighter version and simple proofs
We give simplify the proofs of the 2 results in Marius Zimand's paper "K...
read it
Bruno Bauwens
is this you? claim profile