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

Hideki Yagi, Te Sun Han, Ryo Nomura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2969-2973
Number of pages5
ISBN (Electronic)9781467377041
DOIs
Publication statusPublished - 2015 Sep 28
Externally publishedYes
EventIEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong
Duration: 2015 Jun 142015 Jun 19

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2015-June
ISSN (Print)2157-8095

Other

OtherIEEE International Symposium on Information Theory, ISIT 2015
CountryHong Kong
CityHong Kong
Period15/6/1415/6/19

Fingerprint

Coding
First-order
Theorem
Costs
Scenarios

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this

Yagi, H., Han, T. S., & Nomura, R. (2015). First- and second-order coding theorems for mixed memoryless channels with general mixture. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015 (pp. 2969-2973). [7283001] (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2015.7283001

First- and second-order coding theorems for mixed memoryless channels with general mixture. / Yagi, Hideki; Han, Te Sun; Nomura, Ryo.

Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 2969-2973 7283001 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yagi, H, Han, TS & Nomura, R 2015, First- and second-order coding theorems for mixed memoryless channels with general mixture. in Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015., 7283001, IEEE International Symposium on Information Theory - Proceedings, vol. 2015-June, Institute of Electrical and Electronics Engineers Inc., pp. 2969-2973, IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, Hong Kong, 15/6/14. https://doi.org/10.1109/ISIT.2015.7283001
Yagi H, Han TS, Nomura R. First- and second-order coding theorems for mixed memoryless channels with general mixture. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 2969-2973. 7283001. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2015.7283001
Yagi, Hideki ; Han, Te Sun ; Nomura, Ryo. / First- and second-order coding theorems for mixed memoryless channels with general mixture. Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 2969-2973 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{7cb625f01e5544c790c5eab949e8a19a,
title = "First- and second-order coding theorems for mixed memoryless channels with general mixture",
abstract = "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.",
author = "Hideki Yagi and Han, {Te Sun} and Ryo Nomura",
year = "2015",
month = "9",
day = "28",
doi = "10.1109/ISIT.2015.7283001",
language = "English",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "2969--2973",
booktitle = "Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015",

}

TY - GEN

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

AU - Yagi, Hideki

AU - Han, Te Sun

AU - Nomura, Ryo

PY - 2015/9/28

Y1 - 2015/9/28

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84969850232&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84969850232&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2015.7283001

DO - 10.1109/ISIT.2015.7283001

M3 - Conference contribution

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2969

EP - 2973

BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -