Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,148,106 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
2008
Highly Cited
2008
Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
E. Arıkan
IEEE Transactions on Information Theory
2008
Corpus ID: 889822
A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity I(W) of any…
Expand
Highly Cited
2007
Highly Cited
2007
Gaussian Interference Channel Capacity to Within One Bit
R. Etkin
,
David Tse
,
Hua Wang
IEEE Transactions on Information Theory
2007
Corpus ID: 52855148
The capacity of the two-user Gaussian interference channel has been open for 30 years. The understanding on this problem has been…
Expand
Review
2003
Review
2003
Capacity limits of MIMO channels
A. Goldsmith
,
S. Jafar
,
N. Jindal
,
S. Vishwanath
IEEE J. Sel. Areas Commun.
2003
Corpus ID: 2513807
We provide an overview of the extensive results on the Shannon capacity of single-user and multiuser multiple-input multiple…
Expand
Highly Cited
2003
Highly Cited
2003
Achieving near-capacity on a multiple-antenna channel
B. Hochwald
,
S. Brink
IEEE Transactions on Communications
2003
Corpus ID: 10035441
Recent advancements in iterative processing of channel codes and the development of turbo codes have allowed the communications…
Expand
Highly Cited
2001
Highly Cited
2001
Channel capacity of MIMO architecture using the exponential correlation matrix
S. Loyka
IEEE Communications Letters
2001
Corpus ID: 12746035
Multiple-input multiple output (MIMO) communication architecture has recently emerged as a new paradigm for wireless…
Expand
Highly Cited
2000
Highly Cited
2000
The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel
M. Médard
IEEE Transactions on Information Theory
2000
Corpus ID: 14278660
We present a model for time-varying communication single-access and multiple-access channels without feedback. We consider the…
Expand
Highly Cited
1997
Highly Cited
1997
Capacity of fading channels with channel side information
A. Goldsmith
,
P. Varaiya
IEEE Transactions on Information Theory
1997
Corpus ID: 666312
We obtain the Shannon capacity of a fading channel with channel side information at the transmitter and receiver, and at the…
Expand
Highly Cited
1994
Highly Cited
1994
A general formula for channel capacity
S. Verdú
,
T. Han
IEEE Transactions on Information Theory
1994
Corpus ID: 225582
A formula for the capacity of arbitrary single-user channels without feedback (not necessarily information stable, stationary…
Expand
Highly Cited
1972
Highly Cited
1972
Computation of channel capacity and rate-distortion functions
R. Blahut
IEEE Transactions on Information Theory
1972
Corpus ID: 18060654
By defining mutual information as a maximum over an appropriate space, channel capacities can be defined as double maxima and…
Expand
Highly Cited
1956
Highly Cited
1956
The zero error capacity of a noisy channel
C. Shannon
IRE Transactions on Information Theory
1956
Corpus ID: 44589708
The zero error capacity C_o of a noisy channel is defined as the least upper bound of rates at which it is possible to transmit…
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