Motivated from the fact that universal sourcecoding on countably infinite alphabets (infinity-alphabets) is not feasible, this work introduces the notion of "almost lossless sourcecoding". Analog to the we...
详细信息
Motivated from the fact that universal sourcecoding on countably infinite alphabets (infinity-alphabets) is not feasible, this work introduces the notion of "almost lossless sourcecoding". Analog to the weak variable-length sourcecoding problem studied by Han (IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1217-1226, Jul. 2000), almost lossless sourcecoding aims at relaxing the lossless block-wise assumption to allow an average per-letter distortion that vanishes asymptotically as the block-length tends to infinity. In this setup, we show on one hand that Shannon entropy characterizes the minimum achievable rate (similarly to the case of finite alphabet sources) while on the other that almost lossless universal sourcecoding becomes feasible for the family of finite-entropy stationary memoryless sources with infinity-alphabets. Furthermore, we study a stronger notion of almost lossless universality that demands uniform convergence of the average per-letter distortion to zero, where we establish a necessary and sufficient condition for the so-called family of "envelope distributions" to achieve it. Remarkably, this condition is the same necessary and sufficient condition needed for the existence of a strongly minimax (lossless) universal source code for the family of envelope distributions. Finally, we show that an almost lossless coding scheme offers faster rate of convergence for the (minimax) redundancy compared to the well-known information radius developed for the lossless case at the expense of tolerating a non-zero distortion that vanishes to zero as the block-length grows. This shows that even when lossless universality is feasible, an almost lossless scheme can offer different regimes on the rates of convergence of the (worst case) redundancy versus the (worst case) distortion.
暂无评论