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

Topic mentions per year

Topic mentions per year

1962-2018
05010015019622018

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… (More)
  • 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… (More)
  • figure 1
  • figure 3
  • figure 2
  • 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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A new method is given for performing approximate maximum-likelihood (ML) decoding of an arbitrary binary linear code based on… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The goal of the present paper is the derivation of a framework for the finite-length analysis of message-passing iterative… (More)
  • 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… (More)
  • figure 3
  • figure 4
  • figure 5
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This paper investigates decoding of low-density parity-check (LDPC) codes over the binary erasure channel (BEC). We study the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A serially concatenated code with an interleaver consists of the cascade of an outer code, an interleaver permuting the outer… (More)
  • 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 input n distinct points {(xi, yi)}i=1 from F × F (where F is a field) and… (More)
  • table 1
Is this relevant?
Highly Cited
1985