A Lifting Decoding Scheme and its Application to Interleaved Linear Codes - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

A Lifting Decoding Scheme and its Application to Interleaved Linear Codes

Résumé

In this paper we design a decoding algorithm based on a lifting decoding scheme. This leads to a unique decoding algorithm with complexity quasi linear in all the parameters for Reed-Solomon codes over Galois rings and a list decoding algorithm. We show that, using erasures in our algorithms, allows one to decode more errors than half the minimum distance with a high probability. Finally we apply these techniques to interleaved linear codes over a finite field and obtain a decoding algorithm that can recover more errors than half the minimum distance.
Fichier principal
Vignette du fichier
article.pdf (183.35 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00673938 , version 1 (24-02-2012)
hal-00673938 , version 2 (22-05-2012)

Identifiants

Citer

Guillaume Quintin. A Lifting Decoding Scheme and its Application to Interleaved Linear Codes. International Symposium on Information Theory, Jul 2012, Cambridge, United States. pp.96-100, ⟨10.1109/ISIT.2012.6284707⟩. ⟨hal-00673938v2⟩
430 Consultations
219 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More