A simple class of capacity-achieving strategies for discrete memoryless channels with feedback

被引:3
|
作者
Veugen, T
机构
[1] Department of Electrical Engineering, Technological University
关键词
feedback; constrained sequences; discrete memoryless channel; capacity; repetition strategy;
D O I
10.1109/18.556610
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A class of multiple-repetition strategies is presented for discrete memoryless channels with noiseless feedback. This extends results obtained by Schalkwijk to nonbinary, asymmetric memoryless channels. An interesting characterization of the attainability of a rate is presented in terms of a generating polynomial, from which follows that for each strategy in our class, there exists a discrete memoryless channel such that capacity can be achieved on this channel.
引用
收藏
页码:2221 / 2228
页数:8
相关论文
共 50 条
  • [21] Capacity-Achieving Distributions of Impulsive Ambient Noise Channels
    Vu, Hung V.
    Tran, Nghi H.
    Gursoy, Mustafa Cenk
    Le-Ngoc, Tho
    Hariharan, S. I.
    2015 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2015, : 4042 - 4047
  • [22] Capacity Bounds and Sum Rate Capacities of a Class of Discrete Memoryless Interference Channels
    Zhu, Fangfang
    Chen, Biao
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (07) : 3763 - 3772
  • [23] On the Capacity-achieving Input for Additive Inverse Gaussian Channels
    Li, Hui
    Guo, Dongning
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1829 - +
  • [24] On the Capacity of the Discrete Memoryless Broadcast Channel With Feedback
    Shayevitz, Ofer
    Wigger, Michele
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (03) : 1329 - 1345
  • [25] Capacity-Achieving Resource Allocation for OFDMA Fading Channels
    Li, Zhaoquan
    Wang, Xin
    2012 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2012, : 4578 - 4582
  • [26] ON THE CAPACITY OF DISCRETE MEMORYLESS CHANNELS FOR LINEAR CODES
    VANSACH, T
    PROBLEMS OF CONTROL AND INFORMATION THEORY-PROBLEMY UPRAVLENIYA I TEORII INFORMATSII, 1987, 16 (02): : 113 - 123
  • [27] On a Class of Discrete Memoryless Broadcast Interference Channels
    Liu, Yuanpeng
    Erkip, Elza
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [28] Achieving near-Capacity on Large Discrete Memoryless Channels with Uniform Distributed Selected Input
    Mezghani, Amine
    Ivrlac, Michel T.
    Nossek, Josef A.
    2008 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, VOLS 1-3, 2008, : 1161 - 1166
  • [29] An algebraic, analytic, and algorithmic investigation on the capacity and capacity-achieving input probability distributions of finite-input-finite-output discrete memoryless channels (vol 54, pg 1003, 2008)
    Liang, Xue-Bin
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (09) : 4395 - 4395
  • [30] Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels
    Hof, Eran
    Sason, Igal
    Shamai , Shlomo
    Tian, Chao
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (03) : 1505 - 1516