Skip to search formSkip to main contentSkip to account menu

Noisy-channel coding theorem

Known as: Noisy channel coding theorem, Shannon theorem, Shannon limit 
In information theory, the noisy-channel coding theorem (sometimes Shannon's theorem), establishes that for any given degree of noise contamination… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Shannon theoretic secret key generation by several parties is considered for models in which a secure noisy channel with multiple… 
Highly Cited
2011
Highly Cited
2011
In this paper, we present an advanced solution for the long standing problem of large peak to average power ratio (PAPR) in… 
Highly Cited
2010
Highly Cited
2010
In this paper, we examine the energy efficiency of symmetric key cryptographic algorithms applied in wireless sensor networks… 
2006
2006
A self-contained proof is given of the Noisy Channel Coding Theorem as described in Chapter 8 of Elements of Information Theory… 
Highly Cited
2006
Highly Cited
2006
Adaptive modulation has been shown to have significant benefits for high-speed wireless data transmission when orthogonal… 
Highly Cited
2004
Highly Cited
2004
We propose a novel class of provably good codes which are a serial concatenation of a single-parity-check (SPC)-based product… 
Highly Cited
2002
Highly Cited
2002
Orthogonal frequency division multiplexing (OFDM) is a very attractive technique for high-bit-rate data transmission in multipath… 
2000
2000
A new metric for turbo decoding on Rayleigh fading channels with noisy channel estimates is derived. By including the error… 
Highly Cited
1995
Highly Cited
1995
Blind fractionally spaced (FS) equalizers only require output samples taken at rates higher than the symbol rate to estimate the… 
1992
1992
  • T. Moriya
  • 1992
  • Corpus ID: 7139460
A two-channel conjugate vector quantizer is proposed in an attempt to reduce quantization distortion for noisy channels. In this…