Skip to search formSkip to main contentSkip to account menu

Shannon–Hartley theorem

Known as: Shannon-Hartley, Shannon-Hartley law, Shannon's channel coding theorem 
In information theory, the Shannon–Hartley theorem tells the maximum rate at which information can be transmitted over a communications channel of a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

30 relations
Additive white Gaussian noiseAllan varianceAnalog signalAnti-information

Broader (1)

Information theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Conservative Cell Load Approximation for Radio Networks with Shannon Channels and its Application to LTE Network Planning
The aim of this work is wireless network design and optimization. The well-known Shannon-Hartley formula describes the achievable… 
Highly Cited
2009
Highly Cited
2009
Nonextensive Information Theoretic Kernels on Measures
Positive definite kernels on probability measures have been recently applied to classification problems involving text, images… 
Highly Cited
2009
Highly Cited
2009
Error performance of coded FSO links in turbulent atmosphere modeled by gamma-gamma distributions
For free-space optical (FSO) links in turbulent atmosphere modeled by gamma-gamma distributions, an approximation of the pairwise… 
Highly Cited
2004
Highly Cited
2004
Arithmetic Coding revealed A guided tour from theory to praxis.
This document is an updated and translated version of the Ger man paperArithmetische Kodierung[BCK02] from 2002. It tries to be a… 
Highly Cited
2001
Highly Cited
2001
Interconnect limits on gigascale integration (GSI) in the 21st century
Twenty-first century opportunities for GSI will be governed in part by a hierarchy of physical limits on interconnects whose… 
Highly Cited
2000
Highly Cited
2000
On the construction of some capacity-approaching coding schemes
This thesis proposes two constructive methods of approaching the Shannon limit very closely. Interestingly, these two methods… 
Highly Cited
1999
Highly Cited
1999
Universal Bound on the Performance of Lattice Codes
We present a lower bound on the probability of symbol error for maximum-likelihood decoding of lattices and lattice codes on a… 
Review
1999
Review
1999
The Touchstone of Life: Molecular Information, Cell Communication, and the Foundations of Life
Lowenstein WR. 366 pages. New York: Oxford Univ Pr; 1999. $30.00. ISBN 0195118286. Order phone 800-451-7556. Field of medicine… 
Highly Cited
1998
Highly Cited
1998
Ergodic Theorems for Individual Random Sequences
Highly Cited
1994
Highly Cited
1994
On the asymptotic tightness of the Shannon lower bound
New results are proved on the convergence of the Shannon (1959) lower bound to the rate distortion function as the distortion… 
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)