Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,141,488 papers from all fields of science
Search
Sign In
Create Free Account
Channel capacity
Known as:
System capacity
, Information capacity
, Shannon capacity
Expand
In electrical engineering, computer science and information theory, channel capacity is the tight upper bound on the rate at which information can be…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ADSL loop extender
Anti-information
Arbitrarily varying channel
Bandwidth (signal processing)
Expand
Broader (1)
Information theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Downlink performance and capacity of distributed antenna systems in a multicell environment
Wan Choi
,
J. Andrews
IEEE Transactions on Wireless Communications
2007
Corpus ID: 8359142
Distributed antenna systems (DAS) have been widely implemented in state-of-the art cellular communication systems to cover dead…
Expand
Highly Cited
2007
Highly Cited
2007
Physical Network Coding in Two-Way Wireless Relay Channels
P. Popovski
,
H. Yomo
IEEE International Conference on Communications
2007
Corpus ID: 71815
It has recently been recognized that the wireless networks represent a fertile ground for devising communication modes based on…
Expand
Highly Cited
2006
Highly Cited
2006
Channel coding: The road to channel capacity
J. F. I. Daniel J. Costello
,
J. L. F. I. G. David Forney
Proceedings of the IEEE
2006
Corpus ID: 15968912
Starting from Shannon's celebrated 1948 channel coding theorem, we trace the evolution of channel coding from Hamming codes to…
Expand
Highly Cited
2006
Highly Cited
2006
The Capacity of Channels With Feedback
S. Tatikonda
,
S. Mitter
IEEE Transactions on Information Theory
2006
Corpus ID: 3264610
In this paper, we introduce a general framework for treating channels with memory and feedback. First, we prove a general…
Expand
Highly Cited
2003
Highly Cited
2003
Making gnutella-like P2P systems scalable
Y. Chawathe
,
Sylvia Ratnasamy
,
L. Breslau
,
N. Lanham
,
S. Shenker
Conference on Applications, Technologies…
2003
Corpus ID: 3235299
Napster pioneered the idea of peer-to-peer file sharing, and supported it with a centralized file search facility. Subsequent P2P…
Expand
Highly Cited
2000
Highly Cited
2000
Analysis of video transmission over lossy channels
Klaus Stuhlmüller
,
Nikolaus Färber
,
M. Link
,
B. Girod
IEEE Journal on Selected Areas in Communications
2000
Corpus ID: 14178209
A theoretical analysis of the overall mean squared error (MSE) in hybrid video coding is presented for the case of error prone…
Expand
Highly Cited
1999
Highly Cited
1999
Capacity of Rayleigh fading channels under different adaptive transmission and diversity-combining techniques
Mohamed-Slim Alouini
,
A. Goldsmith
IEEE Transactions on Vehicular Technology
1999
Corpus ID: 15492285
We study the Shannon capacity of adaptive transmission techniques in conjunction with diversity-combining. This capacity provides…
Expand
Highly Cited
1999
Highly Cited
1999
Distributed source coding using syndromes (DISCUS): design and construction
S. Pradhan
,
K. Ramchandran
Proceedings DCC'99 Data Compression Conference…
1999
Corpus ID: 18528474
We address the problem of distributed source coding, i.e. compression of correlated sources that are not co-located and/or cannot…
Expand
Highly Cited
1990
Highly Cited
1990
On channel capacity per unit cost
S. Verdú
IEEE Transactions on Information Theory
1990
Corpus ID: 16990055
Memoryless communication channels with arbitrary alphabets where each input symbol is assigned a cost are considered. The maximum…
Expand
Highly Cited
1982
Highly Cited
1982
Channel coding with multilevel/phase signals
G. Ungerboeck
IEEE Transactions on Information Theory
1982
Corpus ID: 20715426
A coding technique is described which improves error performance of synchronous data links without sacrificing data rate or…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE