The Maximum Error Probability Criterion, Random Encoder, and Feedback, in Multiple Input Channels
暂无分享,去创建一个
[1] R. Ahlswede. Elimination of correlation in random codes for arbitrarily varying channels , 1978 .
[2] Thomas M. Cover,et al. Elements of information theory (2. ed.) , 2006 .
[3] Claude E. Shannon,et al. Two-way Communication Channels , 1961 .
[4] Cyril Leung,et al. An achievable rate region for the multiple-access channel with feedback , 1981, IEEE Trans. Inf. Theory.
[5] Lawrence H. Ozarow,et al. An achievable region and outer bound for the Gaussian broadcast channel with feedback , 1984, IEEE Trans. Inf. Theory.
[6] Zoltán Füredi,et al. A short proof for a theorem of Harper about Hamming-spheres , 1981, Discret. Math..
[7] Rudolf Ahlswede,et al. Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder , 2005, GTIT-C.
[8] Peter Vanroose. Code construction for the noiseless binary switching multiple-access channel , 1988, IEEE Trans. Inf. Theory.
[9] Amos Lapidoth,et al. An improved achievable region for the discrete memoryless two-user multiple-access channel with noiseless feedback , 2005, IEEE Transactions on Information Theory.
[10] Claude E. Shannon,et al. The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.
[11] Imre Csiszár,et al. Capacity of the Gaussian arbitrarily varying channel , 1991, IEEE Trans. Inf. Theory.
[12] Te Sun Han,et al. A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.
[13] Rudolf Ahlswede,et al. Arbitrarily Varying Multiple-Access Channels Part I - Ericson's Symmetrizability Is Adequate, Gubner's Conjecture Is True , 1997, IEEE Trans. Inf. Theory.
[14] Johann-Heinrich Jahn,et al. Coding of arbitrarily varying multiuser channels , 1981, IEEE Trans. Inf. Theory.
[15] Abbas El Gamal,et al. Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).
[16] Jack K. Wolf,et al. The capacity region of a multiple-access discrete memoryless channel can increase with feedback (Corresp.) , 1975, IEEE Trans. Inf. Theory.
[17] G. Kramer,et al. Capacity results for the discrete memoryless network , 1999, Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253).
[18] Rudolf Ahlswede,et al. Multi-way communication channels , 1973 .
[19] Abbas El Gamal,et al. The feedback capacity of degraded broadcast channels (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[20] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[21] Rudolf Ahlswede,et al. The AVC with noiseless feedback and maximal error probability : A capacity formula with a trichotomy , 2006 .
[22] Frans M. J. Willems. The feedback capacity region of a class of discrete memoryless multiple access channels , 1982, IEEE Trans. Inf. Theory.
[23] Gyula O. H. Katona,et al. The Hamming-sphere has minimum boundary , 1975 .
[24] P. Gács,et al. Bounds on conditional probabilities with applications in multi-user communication , 1976 .
[25] Rudolf Ahlswede,et al. On two-way communication channels and a problem by Zarankiewicz , 1973 .
[26] Lawrence H. Ozarow,et al. The capacity of the white Gaussian multiple access channel with feedback , 1984, IEEE Trans. Inf. Theory.
[27] L. H. Harper. Optimal numberings and isoperimetric problems on graphs , 1966 .
[28] John A. Gubner. On the deterministic-code capacity of the multiple-access arbitrarily varying channel , 1990, IEEE Trans. Inf. Theory.
[29] Rudolf Ahlswede,et al. Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback , 2002, IEEE Trans. Inf. Theory.