Skip to Main content Skip to Navigation
Conference papers

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

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 \emph{closest} codewords within an intermediate radius can be performed with improved average-case complexity while retaining the worst-case complexity.
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-00781310
Contributor : Alexander Zeh <>
Submitted on : Wednesday, January 30, 2013 - 7:15:59 PM
Last modification on : Friday, November 22, 2019 - 1:36:52 AM
Long-term archiving on: : Monday, June 17, 2013 - 5:48:18 PM

Files

hal-arxiv20130130.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00781310, version 2
  • ARXIV : 1301.6236

Collections

Citation

Johan Sebastian Rosenkilde Nielsen, Alexander Zeh. Multi-Trial Guruswami--Sudan Decoding for Generalised Reed--Solomon Codes. International Workshop on Coding and Cryptography (WCC), Apr 2013, Bergen, Norway. ⟨hal-00781310v2⟩

Share

Metrics

Record views

414

Files downloads

404