A Lifting Decoding Scheme and its Application to Interleaved Linear Codes

Abstract : 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.
Type de document :
Communication dans un congrès
Guiseppe Caire and Michelle Effros and Hans-Andrea Loeliger and Alexander Vardy. International Symposium on Information Theory, Jul 2012, Cambridge, United States. IEEE, pp.96-100, 2012, Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on. 〈10.1109/ISIT.2012.6284707〉
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00673938
Contributeur : Guillaume Quintin <>
Soumis le : mardi 22 mai 2012 - 18:01:56
Dernière modification le : jeudi 12 avril 2018 - 01:45:36
Document(s) archivé(s) le : jeudi 15 décembre 2016 - 08:26:04

Fichier

article.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Guillaume Quintin. A Lifting Decoding Scheme and its Application to Interleaved Linear Codes. Guiseppe Caire and Michelle Effros and Hans-Andrea Loeliger and Alexander Vardy. International Symposium on Information Theory, Jul 2012, Cambridge, United States. IEEE, pp.96-100, 2012, Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on. 〈10.1109/ISIT.2012.6284707〉. 〈hal-00673938v2〉

Partager

Métriques

Consultations de la notice

391

Téléchargements de fichiers

111