Multi-Trial Guruswami–Sudan Decoding for Generalised Reed–Solomon Codes

Johan Sebastian Rosenkilde Nielsen, Alexander Zeh

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

182 Downloads (Pure)

Abstract

An iterated refinement procedure for the Guruswami–Sudan list decoding algorithm for Generalised Reed–Solomon codes based on Alekhnovich’s module minimisation is proposed. The method is parametrisable and allows variants of the usual list decoding approach. In particular, finding the list of closest codewords within an intermediate radius can be performed with improved average-case complexity while retaining the worst-case complexity.
Original languageEnglish
Title of host publicationWCC 2013 International Workshop on Coding and Cryptography
Number of pages11
Publication date2013
Publication statusPublished - 2013
EventInternational Workshop on Coding and Cryptography (WCC 2013) - Bergen, Norway
Duration: 15 Apr 201319 Apr 2013
http://www.selmer.uib.no/WCC2013/

Conference

ConferenceInternational Workshop on Coding and Cryptography (WCC 2013)
CountryNorway
CityBergen
Period15/04/201319/04/2013
Internet address

Keywords

  • Guruswami–Sudan
  • List Decoding
  • Reed–Solomon Codes
  • Multi-Trial

Fingerprint Dive into the research topics of 'Multi-Trial Guruswami–Sudan Decoding for Generalised Reed–Solomon Codes'. Together they form a unique fingerprint.

Cite this