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)

Related topics

Related topics

25 relations
Additive white Gaussian noiseAnti-informationAsymptotic equipartition propertyBinary entropy function

Broader (2)

Coding theoryInformation theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Energy efficiency of symmetric key cryptographic algorithms in wireless sensor networks
In this paper, we examine the energy efficiency of symmetric key cryptographic algorithms applied in wireless sensor networks… 
Highly Cited
2006
Highly Cited
2006
Adaptive OFDM Systems With Imperfect Channel State Information
Adaptive modulation has been shown to have significant benefits for high-speed wireless data transmission when orthogonal… 
2006
2006
THE NOISY CHANNEL CODING THEOREM
A self-contained proof is given of the Noisy Channel Coding Theorem as described in Chapter 8 of Elements of Information Theory… 
Highly Cited
2005
Highly Cited
2005
Performance analysis of the IEEE 802.11e block ACK scheme in a noisy channel
A block ACK (BTA) scheme has been proposed in IEEE 802.11e to improve medium access control (MAC) layer performance. It is also a… 
Highly Cited
2004
Highly Cited
2004
Product accumulate codes: a class of codes with near-capacity performance and low decoding complexity
We propose a novel class of provably good codes which are a serial concatenation of a single-parity-check (SPC)-based product… 
Highly Cited
2004
Highly Cited
2004
Near-Shannon-limit quasi-cyclic low-density parity-check codes
This letter presents two classes of quasi-cyclic low-density parity-check codes that perform close to the Shannon limit. 
Highly Cited
1997
Highly Cited
1997
Applications of symbolic dynamics in chaos synchronization
We give the relationship between symbolic dynamics and chaos synchronization. If the capacity of the channel which one… 
Highly Cited
1995
Highly Cited
1995
Blind fractionally-spaced equalization of noisy FIR channels: adaptive and optimal solutions
Blind fractionally spaced (FS) equalizers only require output samples taken at rates higher than the symbol rate to estimate the… 
1992
1992
Two-Channel Conjugate Vector Quantizer for Noisy Channel Speech Coding
  • T. Moriya
  • IEEE J. Sel. Areas Commun.
  • 1992
  • Corpus ID: 7139460
A two-channel conjugate vector quantizer is proposed in an attempt to reduce quantization distortion for noisy channels. In this… 
1966
1966
The Performance of Sequential Decoding in Conjunction with Efficient Modulation
The design of a communications system consisting of a sequential encoder-decoder, working in conjunction with a modulation… 
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)