Single-letter characterization of epsilon-capacity for mixed memoryless channels

Hideki Yagi, Ryo Nomura

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

6 Citations (Scopus)

Abstract

For the class of mixed channels decomposed into stationary memoryless channels, single-letter characterizations of the ε-capacity have not been known except for restricted classes of channels such as the regular decomposable channel introduced by Winkelbauer. This paper gives single-letter characterizations of ε-capacity for mixed channels decomposed into at most countably many memoryless channels with a finite input alphabet with/without cost constraints. It is shown that the given characterization reduces to the one for the channel capacity given by Ahlswede when ε is zero. Some properties of the function of the ε-capacity are analyzed.

Original languageEnglish
Title of host publication2014 IEEE International Symposium on Information Theory, ISIT 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2874-2878
Number of pages5
ISBN (Print)9781479951864
DOIs
Publication statusPublished - 2014 Jan 1
Externally publishedYes
Event2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States
Duration: 2014 Jun 292014 Jul 4

Publication series

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

Conference

Conference2014 IEEE International Symposium on Information Theory, ISIT 2014
CountryUnited States
CityHonolulu, HI
Period14/6/2914/7/4

Fingerprint

Channel Capacity
Channel capacity
Decomposable
Costs
Zero
Class

ASJC Scopus subject areas

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

Cite this

Yagi, H., & Nomura, R. (2014). Single-letter characterization of epsilon-capacity for mixed memoryless channels. In 2014 IEEE International Symposium on Information Theory, ISIT 2014 (pp. 2874-2878). [6875359] (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2014.6875359

Single-letter characterization of epsilon-capacity for mixed memoryless channels. / Yagi, Hideki; Nomura, Ryo.

2014 IEEE International Symposium on Information Theory, ISIT 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 2874-2878 6875359 (IEEE International Symposium on Information Theory - Proceedings).

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

Yagi, H & Nomura, R 2014, Single-letter characterization of epsilon-capacity for mixed memoryless channels. in 2014 IEEE International Symposium on Information Theory, ISIT 2014., 6875359, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 2874-2878, 2014 IEEE International Symposium on Information Theory, ISIT 2014, Honolulu, HI, United States, 14/6/29. https://doi.org/10.1109/ISIT.2014.6875359
Yagi H, Nomura R. Single-letter characterization of epsilon-capacity for mixed memoryless channels. In 2014 IEEE International Symposium on Information Theory, ISIT 2014. Institute of Electrical and Electronics Engineers Inc. 2014. p. 2874-2878. 6875359. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2014.6875359
Yagi, Hideki ; Nomura, Ryo. / Single-letter characterization of epsilon-capacity for mixed memoryless channels. 2014 IEEE International Symposium on Information Theory, ISIT 2014. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 2874-2878 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{940b932f2c2a4e21860d78ad0790036e,
title = "Single-letter characterization of epsilon-capacity for mixed memoryless channels",
abstract = "For the class of mixed channels decomposed into stationary memoryless channels, single-letter characterizations of the ε-capacity have not been known except for restricted classes of channels such as the regular decomposable channel introduced by Winkelbauer. This paper gives single-letter characterizations of ε-capacity for mixed channels decomposed into at most countably many memoryless channels with a finite input alphabet with/without cost constraints. It is shown that the given characterization reduces to the one for the channel capacity given by Ahlswede when ε is zero. Some properties of the function of the ε-capacity are analyzed.",
author = "Hideki Yagi and Ryo Nomura",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/ISIT.2014.6875359",
language = "English",
isbn = "9781479951864",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "2874--2878",
booktitle = "2014 IEEE International Symposium on Information Theory, ISIT 2014",

}

TY - GEN

T1 - Single-letter characterization of epsilon-capacity for mixed memoryless channels

AU - Yagi, Hideki

AU - Nomura, Ryo

PY - 2014/1/1

Y1 - 2014/1/1

N2 - For the class of mixed channels decomposed into stationary memoryless channels, single-letter characterizations of the ε-capacity have not been known except for restricted classes of channels such as the regular decomposable channel introduced by Winkelbauer. This paper gives single-letter characterizations of ε-capacity for mixed channels decomposed into at most countably many memoryless channels with a finite input alphabet with/without cost constraints. It is shown that the given characterization reduces to the one for the channel capacity given by Ahlswede when ε is zero. Some properties of the function of the ε-capacity are analyzed.

AB - For the class of mixed channels decomposed into stationary memoryless channels, single-letter characterizations of the ε-capacity have not been known except for restricted classes of channels such as the regular decomposable channel introduced by Winkelbauer. This paper gives single-letter characterizations of ε-capacity for mixed channels decomposed into at most countably many memoryless channels with a finite input alphabet with/without cost constraints. It is shown that the given characterization reduces to the one for the channel capacity given by Ahlswede when ε is zero. Some properties of the function of the ε-capacity are analyzed.

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

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

U2 - 10.1109/ISIT.2014.6875359

DO - 10.1109/ISIT.2014.6875359

M3 - Conference contribution

AN - SCOPUS:84906544665

SN - 9781479951864

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2874

EP - 2878

BT - 2014 IEEE International Symposium on Information Theory, ISIT 2014

PB - Institute of Electrical and Electronics Engineers Inc.

ER -