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

Hideki Yagi, Te Sun Han, Ryo Nomura

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

This paper studies the first- and second-order maximum achievable rates of codes with/without cost constraints for general mixed channels whose channel law is characterized by a mixture of uncountably many stationary and memoryless discrete channels. These channels are referred to as general mixed memoryless channels and include mixed memoryless channels of finitely or countably many memoryless channels as a special case. For general mixed memoryless channels, the first-order coding theorem which gives a formula for the ϵ-capacity is established, and then a direct part of the second-order coding theorem is provided. A subclass of general 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
ホスト出版物のタイトルProceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
出版社Institute of Electrical and Electronics Engineers Inc.
ページ2969-2973
ページ数5
ISBN(電子版)9781467377041
DOI
出版ステータスPublished - 2015 9月 28
外部発表はい
イベントIEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong
継続期間: 2015 6月 142015 6月 19

出版物シリーズ

名前IEEE International Symposium on Information Theory - Proceedings
2015-June
ISSN(印刷版)2157-8095

Other

OtherIEEE International Symposium on Information Theory, ISIT 2015
国/地域Hong Kong
CityHong Kong
Period15/6/1415/6/19

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • 情報システム
  • モデリングとシミュレーション
  • 応用数学

フィンガープリント

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

引用スタイル