The Redundancy of Universal Coding with a Fidelity Criterion

スポンサーリンク

概要

• 論文の詳細を見る

• The redundancy of universal lossy data compression for discrete memoryless sources is considered in terms of type and d-ball covering. It is shown that there exists a universal d-semifaithful code whose rate redundancy is upper bounded by (A-1/2)n^<-1>ln n + o(n^<-1>ln n), where A is the cardinality of source alphabet and n is the block length of the code. This new bound is tighter than known ones, and moreover, it turns out to be the attainable minimum of the universal coding proposed by Davisson.

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

著者

• Ishii D

  Nec Corp. Kawasaki‐shi Jpn

• Yamamoto Hirosuke

  The Department Of Mathematical Engineering And Information Physics Graduate School Of Engineering Un

• ISHII Daiji

  C & C Media Research Laboratories, NEC Corporation

関連論文

• The Redundancy of Universal Coding with a Fidelity Criterion
• A Construction Method of Visual Secret Sharing Schemes for Plural Secret Images(Information Security)(Information Theory and Its Applications)

スポンサーリンク