Fundamental limits are achievable with countable alphabet
PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016)(2016)
摘要
This paper investigates the capacity of a channel and the rate-distortion function of a source, where the alphabets of a channel and a source are uncountable/continuous. It is shown that, when the fundamental limits of the capacity and the rate-distortion function are finite, we can approach these limits with a countable signaling/output alphabet. Furthermore, these limits are also achievable by using codes with a sufficiently large finite signaling/output alphabet. This fact is important in relation to designing implementable codes approaching fundamental limits.
更多查看译文
关键词
fundamental limits,countable alphabet,rate-distortion function,codes
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要