学术探索
学术期刊
新闻热点
数据分析
智能评审

Fifty years of Shannon Theory

被引：149
作者：
Verdu, S [1 ]
机构：
[1] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1998年 / 44卷 / 06期
关键词：
channel capacity; data compression; entropy; history of Information Theory; reliable communication; source coding;
D O I：
10.1109/18.720531
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A brief chronicle is given of the historical development of the central problems in the theory of fundamental Limits of data compression and reliable communication.
引用
收藏
页码：2057 / 2078
页数：22
相关论文
共 421 条
[1]   Code and parse trees for lossless source encoding [J].
Abrahams, J .
COMPRESSION AND COMPLEXITY OF SEQUENCES 1997 - PROCEEDINGS, 1998, :145-171
[2]  
ABRAMSON N, 1963, INFORMATION THEORY C
[3]   INFORMATION-THEORY, COMPLEXITY, AND NEURAL NETWORKS [J].
ABUMOSTAFA, YS .
IEEE COMMUNICATIONS MAGAZINE, 1989, 27 (11) :25-&
[4]   IDENTIFICATION VIA CHANNELS [J].
AHLSWEDE, R ;
DUECK, G .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (01) :15-29
[5]   Universal coding of integers and unbounded search trees [J].
Ahlswede, R ;
Han, TS ;
Kobayashi, K .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (02) :669-682
[6]   On interactive communication [J].
Ahlswede, R ;
Cai, N ;
Zhang, Z .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (01) :22-37
[7]   CHANNEL CAPACITIES FOR LIST CODES [J].
AHLSWEDE, R .
JOURNAL OF APPLIED PROBABILITY, 1973, 10 (04) :824-836
[8]   CAPACITY REGION OF A CHANNEL WITH 2 SENDERS AND 2 RECEIVERS [J].
AHLSWEDE, R .
ANNALS OF PROBABILITY, 1974, 2 (05) :805-814
[9]   CAPACITY OF A CHANNEL WITH ARBITRARILY VARYING CHANNEL PROBABILITY FUNCTIONS AND BINARY OUTPUT ALPHABET [J].
AHLSWEDE, R ;
WOLFOWITZ, J .
ZEITSCHRIFT FUR WAHRSCHEINLICHKEITSTHEORIE UND VERWANDTE GEBIETE, 1970, 15 (03) :186-+
[10]   ELIMINATION OF CORRELATION IN RANDOM CODES FOR ARBITRARILY VARYING CHANNELS [J].
AHLSWEDE, R .
ZEITSCHRIFT FUR WAHRSCHEINLICHKEITSTHEORIE UND VERWANDTE GEBIETE, 1978, 44 (02) :159-175
12345678910