Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Tuesday, January 10, 2017 - 4:11:13 PM
Last modification on : Wednesday, July 8, 2020 - 12:43:27 PM
Document(s) archivé(s) le : Tuesday, April 11, 2017 - 4:09:24 PM


Files produced by the author(s)


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



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⟩



Record views


Files downloads