Live-and-die coding for binary piecewise i.i.d. sources
暂无分享,去创建一个
We propose a binary live-and-die scheme based on arithmetic coding. We also discuss Q-ary live-and-die coding methods. They have a better redundancy behavior than the binary method but also higher complexity demands.
[1] Jorma Rissanen,et al. Universal coding, information, prediction, and estimation , 1984, IEEE Trans. Inf. Theory.
[2] Neri Merhav,et al. On the minimum description length principle for sources with piecewise constant parameters , 1993, IEEE Trans. Inf. Theory.
[3] Frans M. J. Willems,et al. Coding for a binary independent piecewise-identically-distributed source , 1996, IEEE Trans. Inf. Theory.