The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Penyahkod saluran universal untuk keluarga saluran tertentu ialah penyahkod yang boleh direka bentuk tanpa pengetahuan awal tentang ciri-ciri saluran. Namun begitu, ia masih mencapai eksponen ralat pengekodan rawak yang sama seperti penyahkod optimum yang ditala ke saluran. Kertas kerja ini menyiasat dualiti antara penyahkod saluran universal dan pengekod sumber universal. Pertama, untuk keluarga saluran keadaan terhingga, kami menganggap syarat yang mencukupi untuk membina penyahkod saluran universal daripada pengekod sumber universal. Seterusnya, kami menunjukkan kewujudan kod saluran universal yang tidak bergantung pada pilihan penyahkod universal.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Tomohiko UYEMATSU, Saad M. KISRA, "On the Universality of Channel Decoders Constructed from Source Encoders for Finite-State Channels" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 10, pp. 2447-2456, October 2001, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_10_2447/_p
Salinan
@ARTICLE{e84-a_10_2447,
author={Tomohiko UYEMATSU, Saad M. KISRA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Universality of Channel Decoders Constructed from Source Encoders for Finite-State Channels},
year={2001},
volume={E84-A},
number={10},
pages={2447-2456},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={October},}
Salinan
TY - JOUR
TI - On the Universality of Channel Decoders Constructed from Source Encoders for Finite-State Channels
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2447
EP - 2456
AU - Tomohiko UYEMATSU
AU - Saad M. KISRA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2001
AB - 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.
ER -