Some Notes on Universal Noiseless Coding

スポンサーリンク

概要

• 論文の詳細を見る

• This paper presents some tighter bounds on universal noiseless coding, in particular, the lowerbound tighter than Davisson et al.'s for finite sequence and the upperbound for some typical universal data compression. We find that Davisson et al.'s bound satisfies some optimization in the case of using the Jeffreys prior and also that the derived upperbound in this paper is within O(1/n) from the Clarke and Barron asymptotics in the case of some restricted typical universal data compression defined in the paper.

• 一般社団法人電子情報通信学会の論文
• 1995-12-25

著者

• Suzuki Joe

  Faculty Of Science Osaka University

関連論文

• Some Notes on Universal Noiseless Coding
• Learning Bayesian Belief Networks Based on the Minimum Description Length Principle: Basic Properties

スポンサーリンク