Skip to Main content Skip to Navigation
Conference papers

Re-encoding reformulation and application to Welch-Berlekamp algorithm

Morgan Barbier 1, * 
* Corresponding author
1 Equipe SAFE - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen
Abstract : The main decoding algorithms for Reed-Solomon codes are based on a bivariate interpolation step, which is expensive in time complexity. Lot of interpolation methods were proposed in order to decrease the complexity of this procedure, but they stay still expensive. Then Koetter, Ma and Vardy proposed in 2010 a technique, called re-encoding, which allows to reduce the practical running time. However, this trick is only devoted for the Koetter interpolation algorithm. We propose a reformulation of the re-encoding for any interpolation methods. The assumption for this reformulation permits only to apply it to the Welch-Berlekamp algorithm.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Morgan Barbier Connect in order to contact the contributor
Submitted on : Friday, July 11, 2014 - 1:56:23 PM
Last modification on : Saturday, June 25, 2022 - 9:48:54 AM
Long-term archiving on: : Tuesday, April 11, 2017 - 12:12:13 PM


Files produced by the author(s)


  • HAL Id : hal-00768536, version 2
  • ARXIV : 1212.5554


Morgan Barbier. Re-encoding reformulation and application to Welch-Berlekamp algorithm. Re-encoding reformulation and application to Welch-Berlekamp algorithm, Jun 2014, Hawai'i, United States. pp.1782 - 1786. ⟨hal-00768536v2⟩



Record views


Files downloads