A Universal Affine Code for Symmetric Channels

スポンサーリンク

概要

• 論文の詳細を見る

• This paper investigates the performance of a combination of the affine encoder and the maximum mutual information decoder for symmetric channels, and proves that the random coding error exponent can be attained by this combination even if the conditional probability of the symmetric channel is not known to the encoder and decoder. This result clarifies that the restriction of the encoder to the class of affine encoders does not affect the asymptotic performance of the universal code for symmetric channels.

• （社）電子情報通信学会の論文
• 2011-11-01

著者

• Uyematsu Tomohiko

  Dept. Of Comm. And Integrated Systems Tokyo Institute Of Technology

関連論文

• Secret Key Capacity for Ergodic Correlated Sources(Information Theory)
• Conditional Lempel-Ziv Complexity and Its Application to Source Coding Theorem with Side Information(Source Coding/Imge Processing)(Information Theory and Its Applications)
• Universal Lossy Coding for Individual Sequences Based on Complexity Functions(Information Theory)
• Relationship among Complexities of Individual Sequences over Countable Alphabet(Information Theory)
• Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet
• Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices
• Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers
• A New Unified Method for Fixed-Length Source Coding Problems of General Sources
• Fixed-Slope Universal Lossy Coding for Nonstationary Sources
• Applicability of the Sample Path Method of Ergodic Processes to Individual Sequences
• An algorithm for random number generation by using arithmetic of limited precision : Part II
• A General Formula of the Capacity Region for Multiple-Access Channels with Deterministic Feedback
• A Universal Affine Code for Symmetric Channels
• Parametric Forms of the Achievable Rate Region for Source Coding with a Helper

もっと見る 閉じる

スポンサーリンク