New Results on Optimistic Source Coding(Information Theory)(<Special Section>Information Theory and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• Optimistic coding is a coding in which we require the existence of reliable codes for infinitely many block length. In this letter we consider the optimistic source coding theorems for a general source Z from the information-spectrum approach. We first formulate the problem to be considered clearly. We obtain the optimistic infimum achievable source coding rate T__<-ε>(Z) for the case where decoding error probability sn is asymptotically less than or equal to an arbitrarily given ε∈[0, 1). In fact, T__<-ε>(Z) turns out to be expressed in a form similar to the ordinary infimum achievable source coding rate. A new expression for T__<-ε>(Z) is also given. In addition, we investigate the case where ε_n = 0 for infinitely many n and obtain the infimum achievable coding rate.

• 社団法人電子情報通信学会の論文
• 2004-10-01

著者

• Sato N

  Master's Program In Science And Engineering At University Of Tsukuba

• Koga Hiroki

  Graduate School Of Systems And Information Engineering University Of Tsukuba

• SATO Naoki

  Master's Program in Science and Engineering at University of Tsukuba

関連論文

• On the Asymptotic Behaviors of the Recurrence Time with Fidelity Criterion for Discrete Memoryless Sources and Memoryless Gaussian Sources
• A Digital Fingerprinting Code Based on a Projective Plane and Its Identifiability of All Malicious Users
• The Optimal (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels
• New Results on Optimistic Source Coding(Information Theory)(Information Theory and Its Applications)
• Four Limits in Probability and Their Roles in Source Coding

スポンサーリンク