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

Decoding methods

Known as: Mimimum distance decoding, Minimum distance decoding, Ideal observer decoding 
In coding theory, decoding is the process of translating received messages into codewords of a given code. There have been many common methods of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
We describe a successive-cancellation list decoder for polar codes, which is a generalization of the classic successive… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
When binary linear error-correcting codes are used over symmetric channels, a relaxed version of the maximum likelihood decoding… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The problem of finding the least-squares solution to a system of linear equations where the unknown vector is comprised of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We address an open question, regarding whether a lattice code with lattice decoding (as opposed to maximum-likelihood (ML… Expand
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Since the discovery of parallel concatenated (turbo) codes, iterative decoding has become a vital field of research in digital… Expand
  • figure 1
  • table 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We present a maximum-likelihood decoding algorithm for an arbitrary lattice code when used over an independent fading channel… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
nowledge management is an essential capability in the emerging knowledge economy. In particular, organizations have a valuable… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We present a randomized algorithm which takes as inputndistinct points {(xi,yi)}i= 1nfromF×F(whereFis a field) and integer… Expand
  • table 1
Is this relevant?
Highly Cited
1985
Highly Cited
1985
  • David Chase
  • IEEE Transactions on Communications
  • 1985
  • Corpus ID: 31387002
It is well known that if the data rate is chosen below the available channel capacity, error-free communication is possible… Expand
Is this relevant?
Highly Cited
1966
Highly Cited
1966
We introduce a new distance measure which permits likelihood information to be used in algebraic minimum distance decoding… Expand
Is this relevant?