A list decoding algorithm for practical reed-solomon codes

  • Sergey Egorov
  • Published 2013 in East-West Design & Test Symposium (EWDTS 2013)


A novel algorithm is proposed for decoding of Reed-Solomon codes beyond half the minimum distance. This algorithm is based on analytical continuation of the Berlekamp-Massey algorithm through additional iterations. It is shown that the proposed algorithm allows to correct more errors compared to Guruswami-Sudan (GS) algorithm. Also computational complexity… (More)
DOI: 10.1109/EWDTS.2013.6673101

4 Figures and Tables


  • Presentations referencing similar topics