On the Universality of Channel Decoders Constructed from Source Encoders for Finite-State Channels(Special Section on Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
A universal channel decoder for a given family of channels is a decoder that can be designed without prior knowledge of the characteristics of the channel. Nevertheless, it still attains the same random coding error exponent as the optimal decoder tuned to the channel. This paper investigates the duality between universal channel decoders and universal source encoders. First, for the family of finite-state channels, we consider a sufficient condition for constructing universal channel decoders from universal source encoders. Next, we show the existence of a universal channel code that does not depend on the choice of the universal decoder.
- 社団法人電子情報通信学会の論文
- 2001-10-01
著者
-
Uyematsu Tomohiko
The Department Of Commumcations And Integrated Systems Tokyo Institute Of Technology
-
Uyematsu Tomohiko
The Department Of Communications And Information Systems Tokyo Institute Of Technology
-
KISRA Saad
the Department of Communications and Information Systems, Tokyo Institute of Technology
-
Kisra Saad
The Department Of Communications And Information Systems Tokyo Institute Of Technology
関連論文
- Efficient Secret Sharing Schemes Based on Authorized Subsets(Cryptography and Information Security)
- Two Algorithms for Random Number Generation Implemented by Using Arithmetic of Limited Precision(Information Security)(Information Theory and Its Applications)
- On the Universality of Channel Decoders Constructed from Source Encoders for Finite-State Channels(Special Section on Information Theory and Its Applications)
- Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight