An Alternative to Factorization: a Speedup for SUDAN's Decoding Algorithm and its Generalization to Algebraic-Geometric Codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1998

An Alternative to Factorization: a Speedup for SUDAN's Decoding Algorithm and its Generalization to Algebraic-Geometric Codes

Daniel Augot
  • Function : Author
  • PersonId : 833459

Abstract

We propose an improvement to SUDAN's algorithm for decoding REED-SOLOMON codes beyond half of their minimum distance, and its generalisation to algebraic-geometric codes. Both algorithms, in their original version, involve factorisation of polynomials. The main idea consists in replacing factorisation by an iterative root finding procedure of low complexity based on NEWTON approximation. In the case of REED-SOLOMON codes we give real complexity of tau-reconstructio- n.
Fichier principal
Vignette du fichier
RR-3532.pdf (300 Ko) Télécharger le fichier

Dates and versions

inria-00073153 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073153 , version 1

Cite

Daniel Augot, Lancelot Pecquet. An Alternative to Factorization: a Speedup for SUDAN's Decoding Algorithm and its Generalization to Algebraic-Geometric Codes. [Research Report] RR-3532, INRIA. 1998. ⟨inria-00073153⟩
104 View
81 Download

Share

Gmail Facebook Twitter LinkedIn More