Reduced complexity interpolation for soft-decoding of Reed-Solomon codes

Arshad Ahmed, Ralf Koetter, Naresh R. Shanbhag

Research output: Contribution to journalConference articlepeer-review

Abstract

The re-encoding based interpolation algorithm [1] is modified such that intermediate interpolation results are also useful towards solving the algebraic soft-decoding problem. By factorization of a chosen subset of intermediate results, desired coding gains are obtained at lower interpolation costs.

Original languageEnglish (US)
Pages (from-to)385
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - 2004
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: Jun 27 2004Jul 2 2004

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Reduced complexity interpolation for soft-decoding of Reed-Solomon codes'. Together they form a unique fingerprint.

Cite this