# First- and second-order coding theorems for mixed memoryless channels with general mixture

Hideki Yagi, Te Sun Han, Ryo Nomura

6 被引用数 (Scopus)

## 抄録

This paper investigates the first- and second-order maximum achievable rates of codes with/without cost constraints for mixed channels whose channel law is characterized by a general mixture of (at most) uncountably many stationary and memoryless discrete channels. These channels are referred to as mixed memoryless channels with general mixture and include the class of mixed memoryless channels of finitely or countably memoryless channels as a special case. For the mixed memoryless channels with general mixture, the first-order coding theorem which gives a formula for the $\varepsilon$ -capacity is established, and then a direct part of the second-order coding theorem is provided. A subclass of mixed memoryless channels whose component channels can be ordered according to their capacity is introduced, and the first- and second-order coding theorems are established. It is shown that the established formulas reduce to several known formulas for restricted scenarios.

本文言語 English 7479457 4395-4412 18 IEEE Transactions on Information Theory 62 8 https://doi.org/10.1109/TIT.2016.2573310 Published - 2016 8月 はい

## ASJC Scopus subject areas

• 情報システム
• コンピュータ サイエンスの応用
• 図書館情報学

## フィンガープリント

「First- and second-order coding theorems for mixed memoryless channels with general mixture」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。