D -Semifaithful Codes That are Universal Over Both Memoryless Sources and Distortion Measures
Neri Merhav · IEEE Transactions on Information Theory · 2023
We prove the existence of codebooks for$d$-semifaithful lossy compression that are simultaneously universal with respect to both the class of finite-alphabet memoryless sources and the class of all bounded additive rational distortion measures. By applying independent random selection of the codewords according to a mixture of all memoryless sources, we achieve redundancy rates that are within$O(\log n/n)$close to the empirical rate-distortion function of every given source vector with respect to every bounded, rational distortion measure.