Enhanced Recursive Reed-Muller Erasure Decoding

Abstract : Recent work have shown that Reed-Moller (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
2016 IEEE International Symposium on Information Theory (ISIT), Jul 2016, Barcelona, Spain. 2016 IEEE International Symposium on Information Theory (ISIT), pp. 1760-1763, 2016
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01431242
Contributeur : Open Archive Toulouse Archive Ouverte (oatao) <>
Soumis le : mardi 10 janvier 2017 - 16:11:13
Dernière modification le : samedi 14 janvier 2017 - 01:08:45
Document(s) archivé(s) le : mardi 11 avril 2017 - 16:09:24

Fichier

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

Identifiants

  • HAL Id : hal-01431242, version 1
  • OATAO : 16226

Collections

Citation

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

Partager

Métriques

Consultations de
la notice

149

Téléchargements du document

43