On the complexity of decoding Reed-Solomon codes (Corresp.)

  • Authors:

  • J. Justesen

  • Affiliations:

  • -

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.84

Visualization

Abstract

Certainq-ary Reed-Solomon codes can be decoded by an algorithm requiring onlyO(q log^{2} q)additions and multiplications inGF(q).