Enhanced Recursive Reed-Muller Erasure Decoding
Information Theory
2016-01-27 v1 math.IT
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.
Cite
@article{arxiv.1601.06908,
title = {Enhanced Recursive Reed-Muller Erasure Decoding},
author = {Alexandre Soro and Jerome Lacan and Vincent Roca and Valentin Savin and Mathieu Cunche},
journal= {arXiv preprint arXiv:1601.06908},
year = {2016}
}