Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
In this paper, we construct protograph-based spatially coupled low-density parity-check (LDPC) codes by coupling together a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2014
Highly Cited
2014
As the deployment and commercial operation of 4G systems are speeding up, technologists worldwide have begun searching for next… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
The Quantum Reverse Shannon Theorem states that any quantum channel can be simulated by an unlimited amount of shared… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
The aim of this work is wireless network design and optimization. The well-known Shannon-Hartley formula describes the achievable… Expand
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
How can the development of ideas in a scientific field be studied over time? We apply unsupervised topic modeling to the ACL… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
High dimensionality of text can be a deterrent in applying complex learners such as Support Vector Machines to the task of text… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We develop improved algorithms to construct good low-density parity-check codes that approach the Shannon limit very closely. For… Expand
  • table I
  • table II
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This thesis proposes two constructive methods of approaching the Shannon limit very closely. Interestingly, these two methods… Expand
  • table 3.1
  • figure 3-5
  • figure 3-6
  • figure 3-7
  • figure 3-10
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We present a lower bound on the probability of symbol error for maximum-likelihood decoding of lattices and lattice codes on a… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Hidden Markov models assume a sequence of random variables to be conditionally independent given a sequence of state variables… Expand
Is this relevant?