New Algebraic Soft Decision Decoding Algorithm for Reed-Solomon Code

2014/07/30 by Yuan Zhu, Zhu, Yuan, Tang, Siyun
Computer Science · Engineering · #Coding theory and cryptography #Cryptographic Implementations and Security #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1407.8069

openalex publication_date 2014/07/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, a new algebraic soft-decision decoding algorithm for Reed-Solomon code is presented. It is based on rational interpolation and the interpolation points are constructed by Berlekamp-Messay algorithm. Unlike the traditional Kötter-Vardy algorithm, new algorithm needs interpolation for two smaller multiplicity matrixes, due to the corresponding factorization algorithm for re-constructing codewords.

Related

• Performance Analysis of Algebraic Soft-Decision Decoding of Reed-Solomon Codes
• Algebraic Soft Decoding of Reed-Solomon Codes Using Module Minimization
• Algebraic Soft-Decision Decoding of Reed-Solomon Codes Using Bit-level Soft Information
• Iterative Soft Input Soft Output Decoding of Reed-Solomon Codes by Adapting the Parity Check Matrix
• Algebraic Soft-Decision Decoding of Hermitian Codes