A Universal Data-Base for Data Compression

スポンサーリンク

概要

• 論文の詳細を見る

• A data-base for data compression is universal if in its construction no prior knowledge of the source distribution is assumed and is optimal if, when we encode the reference index of the data-base, its encoding rate achieves the optimal encoding rate for any given source : in the noiseless case the entropy rate and in the semifaithful case the rate-distortion function of the source. In the present paper, we construct a universal data-base for all stationary ergodic sources, and prove the optimality of the thus constructed data-base for two typical methods of referring to the data-base : one is a block-shift type reference and the other is a single-shift type referrence.

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

著者

• Muramatsu J

  Ntt Corp. Kyoto‐fu Jpn

• Kanaya F

  Shonan Inst. Technol. Fujisawa‐shi Jpn

• Kanaya Fumio

  Shonan Institute Of Technology

• Muramatsu Jun

  NTT Optical Network Systems Laboratories

関連論文

• An Almost Sure Recurrence Theorem with Distortion for Stationary Ergodic Sources
• A Universal Data-Base for Data Compression
• Dual Quantity of the Distortion-Complexity and a Universal Data-Base for Fixed-Rate Data Compression with Distortion (Special Section on Information Theory and Its Applications)

スポンサーリンク