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

Guruswami–Sudan list decoding algorithm

Known as: Guruswami-Sudan List Decoding Algorithm 
In coding theory, list decoding is an alternative to unique decoding of error-correcting codes for large error rates. Using unique decoder one can… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We analyze the Guruswami--Sudan list decoding algorithm for Reed--Solomon codes over the complex field for sparse recovery in… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
2014
2014
An iterated refinement procedure for the Guruswami–Sudan list decoding algorithm for Generalised Reed–Solomon codes based on… Expand
Is this relevant?
2012
2012
Compared to binary low-density parity-check (LDPC) codes, nonbinary LDPC codes have better error performance when the code length… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2011
2011
Traditionally, multi-trial error/erasure decoding of Reed-Solomon (RS) codes is based on Bounded Minimum Distance (BMD) decoders… Expand
  • figure 1
  • figure 2
Is this relevant?
2010
2010
  • Peter Trifonov
  • IEEE Transactions on Information Theory
  • 2010
  • Corpus ID: 12208528
A novel algorithm is proposed for the interpolation step of the Guruswami-Sudan list decoding algorithm. The proposed method is… Expand
  • figure 7
  • figure 6
Is this relevant?
2009
2009
We revisit the generalisation of the Guruswami–Sudan list decoding algorithm to Reed–Muller codes. Although the generalisation is… Expand
Is this relevant?
2008
2008
In 2000 Roth and Ruckenstein proposed an extended key equation for solving the interpolation step in the Sudan decoding algorithm… Expand
  • figure 2
  • figure 1
Is this relevant?
2006
2006
Divide-and-conquer method for interpolation in Guruswami-Sudan (GS) list decoding algorithm is considered. It is shown that the… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A polynomial-time soft-decision decoding algorithm for Reed-Solomon codes is developed. This list-decoding algorithm is algebraic… Expand
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
  • Luca Trevisan
  • 44th Annual IEEE Symposium on Foundations of…
  • 2003
  • Corpus ID: 1442236
We show that Yao's XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way… Expand
Is this relevant?