Capacity Results for Discrete Memoryless Channels in the Finite Blocklength Regime

被引：0
|
作者：
Oohama, Yasutada [1 ]
机构：
[1] Univ Electrocommun, Tokyo, Japan
来源：
2019 IEEE INFORMATION THEORY WORKSHOP (ITW) | 2019年
关键词：
Discrete memoryless channels; Strong converse theorem; Information spectrum approach;
D O I：
10.1109/itw44776.2019.8989294
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We study the determination problem of the channel capacity for the discrete memoryless channels in the finite blocklength regime. We derive explicit lower and upper bounds of the capacity. We shall demonstrate that the information spectrum approach is quite useful for investigating this problem.
引用
收藏
页码：654 / 658
页数：5
相关论文
共 50 条
  • [11] Achieving Capacity of Large Alphabet Discrete Memoryless Channels
    Gao, Yuguang
    Wagner, Aaron B.
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 2468 - 2472
  • [12] A NEWTON ALGORITHM FOR COMPUTING THE CAPACITY OF DISCRETE MEMORYLESS CHANNELS
    YAMAMURA, K
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1992, E75A (11) : 1583 - 1589
  • [13] Covert communication with beamforming over MISO channels in the finite blocklength regime
    Yu, Xinchun
    Luo, Yuan
    Chen, Wen
    SCIENCE CHINA-INFORMATION SCIENCES, 2021, 64 (09)
  • [14] Covert communication with beamforming over MISO channels in the finite blocklength regime
    Xinchun YU
    Yuan LUO
    Wen CHEN
    Science China(Information Sciences), 2021, 64 (09) : 187 - 201
  • [15] A Random Matrix Approach to the Finite Blocklength Regime of MIMO Fading Channels
    Hoydis, Jakob
    Couillet, Romain
    Piantanida, Pablo
    Debbah, Merouane
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [16] Covert communication with beamforming over MISO channels in the finite blocklength regime
    Xinchun Yu
    Yuan Luo
    Wen Chen
    Science China Information Sciences, 2021, 64
  • [17] Rectangular algorithm for computing the capacity of arbitrary discrete memoryless channels
    Yamamura, Kiyotaka
    Fukuyama, Kenjirou
    Horiuchi, Kazuo
    Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi), 1991, 74 (02): : 1 - 9
  • [18] On the Capacity of Abelian Group Codes Over Discrete Memoryless Channels
    Sahebi, Aria G.
    Pradhan, S. Sandeep
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011,
  • [19] GEOMETRICAL METHOD FOR CALCULATING THE CAPACITY OF DISCRETE MEMORYLESS CHANNELS.
    Watanabe, Yoichiro
    Electronics & communications in Japan, 1981, 64 (11): : 9 - 17
  • [20] A New Iterative Algorithm for Calculating the Capacity of Discrete Memoryless Channels
    Liang, Xue-Bin
    GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2006,
12345