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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

Defined through a certain 2 × 2 matrix called Arikan's kernel, polar codes are known to achieve the symmetric capacity of binary…

2016

We analyze the Guruswami--Sudan list decoding algorithm for Reed--Solomon codes over the complex field for sparse recovery in…

2013

An iterated refinement procedure for the Guruswami–Sudan list decoding algorithm for Generalised Reed–Solomon codes based on…

2013

We prove improved inapproximability results for hypergraph coloring using the low-degree polynomial code (aka, the"short code" of…

2011

Traditionally, multi-trial error/erasure decoding of Reed-Solomon (RS) codes is based on Bounded Minimum Distance (BMD) decoders…

2009

We revisit the generalisation of the Guruswami–Sudan list decoding algorithm to Reed–Muller codes. Although the generalisation is…

2007

List decoding is a novel method for decoding Reed-Solomon (RS) codes that generates a list of candidate transmitted messages…

2006

Divide-and-conquer method for interpolation in Guruswami-Sudan (GS) list decoding algorithm is considered. It is shown that the…

2006

List decoding algorithms improve the error-correction performance of a code by generating a list of possible transmitted messages…

2004

In this paper, we propose an iterative soft decision decoding scheme for Reed Solomon codes with near maximum likelihood…