Achieving Capacity of Large Alphabet Discrete Memoryless Channels

被引：0

作者：

Gao, Yuguang ^{[1
]}

Wagner, Aaron B. ^{[1
]}

机构：

[1] Cornell Univ, Sch Elect & Comp Engn, Ithaca, NY 14853 USA

来源：

2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) | 2013年

基金：

美国国家科学基金会;

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

It is observed that some communication situations fall into the large alphabet setting, in which the number of channel parameters and the number of channel uses are both large. To model such situations, we consider Discrete Memoryless Channels (DMCs) in which the input and output alphabet sizes increase along with the blocklength n. For known channels, we show that reliable communication at the sequence of channel capacities is possible if and only if the minimum between the square logarithms of the input and the output alphabet sizes grows sublinearly with n. For unknown channels with feedback, we show that universal channel coding can be supported if the input-output product alphabet size grows sublinearly with n.

引用

页码：2468 / 2472

页数：5

共 50 条

[21] Quantum Polarization Codes for Capacity-Achieving in Discrete Memoryless Quantum Channel [J].

Huang, Dazu ;

Chen, Zhigang ;

Li, Xin ;

Guo, Ying .

FRONTIERS OF MANUFACTURING AND DESIGN SCIENCE, PTS 1-4, 2011, 44-47 :2978-+

[22] Bounds on the Capacity of Discrete Memoryless Channels Corrupted by Synchronization and Substitution Errors [J].

Mercier, Hugues ;

Tarokh, Vahid ;

Labeau, Fabrice .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (07) :4306-4330

[23] Capacity-Maximizing Input Symbol Selection for Discrete Memoryless Channels [J].

Egger, Maximilian ;

Bitar, Rawad ;

Wachter-Zeh, Antonia ;

Gunduz, Deniz ;

Weinberger, Nir .

2024 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, ISIT 2024, 2024, :723-728

[24] THE FEEDBACK CAPACITY REGION OF A CLASS OF DISCRETE MEMORYLESS MULTIPLE ACCESS CHANNELS [J].

WILLEMS, FMJ .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1982, 28 (01) :93-95

[25] The Zero-Undetected-Error Capacity of Discrete Memoryless Channels with Feedback [J].

Bunte, Christoph ;

Lapidoth, Amos .

2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2012, :1838-1842

[26] On the Average-Listsize Capacity and the Cutoff Rate of Discrete Memoryless Channels with Feedback [J].

Bunte, Christoph ;

Lapidoth, Amos .

2013 IEEE INFORMATION THEORY WORKSHOP (ITW), 2013,

[27] An algebraic, analytic, and algorithmic investigation on the capacity and capacity-achieving input probability distributions of finite-input-finite-output discrete memoryless channels [J].

Liang, Xue-Bin .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (03) :1003-1023

[28] Capacity Bounds and Sum Rate Capacities of a Class of Discrete Memoryless Interference Channels [J].

Zhu, Fangfang ;

Chen, Biao .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (07) :3763-3772

[29] Discrete memoryless interference channels with feedback [J].

Jiang, Jinhua ;

Xin, Yan ;

Garg, Hari Krishna .

2007 41ST ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1 AND 2, 2007, :581-584

[30] Polarization for arbitrary discrete memoryless channels [J].

Sasoglu, Eren ;

Telatar, Emre ;

Arikan, Erdal .

2009 IEEE INFORMATION THEORY WORKSHOP (ITW 2009), 2009, :144-148

← 1 2 3 4 5 →