Enhanced Recursive Reed-Muller Erasure Decoding - Centre of Innovation in Telecommunications and Integration of services Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Enhanced Recursive Reed-Muller Erasure Decoding

Résumé

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.
Fichier principal
Vignette du fichier
Soro_16226.pdf (220.13 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01431242 , version 1 (10-01-2017)

Identifiants

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

Citer

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. pp. 1760-1763. ⟨hal-01431242⟩
347 Consultations
278 Téléchargements

Partager

Gmail Facebook X LinkedIn More