2014/07/01 by Hideki Yagi, Yagi, Hideki, Ryo Nomura +1 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Memory and Neural Computing #FOS: Computer and information sciences #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture #Quantum-Dot Cellular Automata #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1407.0124
This is an extended version of the paper submitted to the 2014 IEEE International Symposium on Information Theory (ISIT2014)
arxiv created 2014/07/01 · openalex publication_date 2014/07/01 · arxiv updated 2014/07/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 and a general output alphabet with/without cost constraints. It is shown that a given characterization reduces to the one for the channel capacity given by Ahlswede when ε is zero. In the proof of the coding theorem, the meta converse bound, originally given by Polyanskiy, Poor and Verdú, is particularized for the mixed channel decomposed into general component channels.