Enhanced Recursive Reed-Muller Erasure Decoding

Abstract : Recent work have shown that Reed-Muller (RM) codes achieve the erasure channel capacity. However, this performance is obtained with maximum-likelihood decoding which can be costly for practical applications. In this paper, we propose an encoding/decoding scheme for Reed-Muller codes on the packet erasure channel based on Plotkin construction. We present several improvements over the generic decoding. They allow, for a light cost, to compete with maximum-likelihood decoding performance, especially on high-rate codes, while significantly outperforming it in terms of speed.
Type de document :
Communication dans un congrès
IEEE. IEEE International Symposium on Information Theory (ISIT), Jul 2016, Barcelona, Spain. IEEE International Symposium on Information Theory (ISIT)
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01320563
Contributeur : Vincent Roca <>
Soumis le : mardi 24 mai 2016 - 10:08:33
Dernière modification le : mercredi 25 mai 2016 - 01:06:58

Fichier

isit16_reed_muller_recursive_e...
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01320563, version 1

Collections

Citation

Alexandre Soro, Jérôme Lacan, Vincent Roca, Valentin Savin, Mathieu Cunche. Enhanced Recursive Reed-Muller Erasure Decoding. IEEE. IEEE International Symposium on Information Theory (ISIT), Jul 2016, Barcelona, Spain. IEEE International Symposium on Information Theory (ISIT). 〈hal-01320563〉

Partager

Métriques

Consultations de
la notice

149

Téléchargements du document

87