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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Starting from Shannon's celebrated 1948 channel coding theorem, we trace the evolution of channel coding from Hamming codes to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
A self-contained proof is given of the Noisy Channel Coding Theorem as described in Chapter 8 of Elements of Information Theory… (More)
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… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The noisy channel model has been applied to a wide range of problems, including spelling correction. These models consist of two… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Noisy quantum channels may be used in many information carrying applications. We show that different applications may result in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
This paper deals with a new class of convolutional codes called Turbo-codes, whose performances in terms of Bit Error Rate (BER… (More)
Is this relevant?
1996
1996
We propose an optimal bit allocation strategy for a joint source/channel video codec over noisy channel when the channel state is… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Ahsfracf -We present an analysis of the zero-memory quantization of memoryless sources when the quantizer output is to be encoded… (More)
  • figure 1
  • figure 2
  • table I
  • table IV
  • figure 3
Is this relevant?
Highly Cited
1977
Highly Cited
1977
Tree encoding and sequential decoding are considered for noisy channels that respond a random number of times to each input. Such… (More)
  • figure 1
  • figure 4
  • table I
Is this relevant?
Highly Cited
1956
Highly Cited
1956
Biography of Claude Elwood Shannon. Profile of Claude Shannon _ Interview by Anthony Liversidge Bibliography of Claude Elwood… (More)
Is this relevant?