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
N1 - Funding Information:
This research was supported in part by MEXT under Grant-in-Aid for Scientific Research (C) No. 25420357 and No. 26420371.
Publisher Copyright:
© 2015 IEEE.
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
AN - SCOPUS:84969850232
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.
T2 - IEEE International Symposium on Information Theory, ISIT 2015
Y2 - 14 June 2015 through 19 June 2015
ER -