Towards Weak Source Coding

In this paper, the authors provide a weak decoding version of the traditional source coding theorem of Claude Shannon. The central bound that is obtained is \[ χ>\log_ε(2^{-n(H(X)+ε)}) \] where \[ χ=\frac{\log(k)}{n(H(X)+ε)} \] and $k$ is the number of unsupervised learning classes formed out of the... View More