Pages that link to "Item:Q1311609"

The following pages link to Two new decoding algorithms for Reed-Solomon codes (Q1311609):

Displaying 17 items.

• Simple algorithms for decoding systematic Reed-Solomon codes (Q356717) (← links)
• The decoding of extended Reed-Solomon codes (Q803107) (← links)
• New approaches to reduced-complexity decoding (Q1180151) (← links)
• VLSI architecture of modified Euclidean algorithm for Reed-Solomon code. (Q1425296) (← links)
• A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes (Q1675777) (← links)
• Decoding Reed-Solomon codes beyond \((d-1)/2\) and zeros of multivariate polynomials (Q1897984) (← links)
• Inversionless decoding of both errors and erasures of Reed-Solomon code (Q2714793) (← links)
• High-speed decoder of Reed-Solomon codes (Q2726536) (← links)
• Advances in the performance of Reed-Solomon codes (Q2732700) (← links)
• On decoding of both errors and erasures of a Reed-Solomon code using an inverse-free Berlekamp-Massey algorithm (Q2732767) (← links)
• A New Algorithm for Decoding Reed-Solomon Codes (Q3448743) (← links)
• Power Decoding of Reed–Solomon Codes Revisited (Q3460479) (← links)
• A Simple Algorithm for Decoding Reed–Solomon Codes and its Relation to the Welch–Berlekamp Algorithm (Q3546866) (← links)
• The software implementation of decoding for RS code based on a new degree computationless modified Euclid (DCME) algorithm (Q3559702) (← links)
• (Q4494935) (← links)
• A Decoding Approach to Reed–Solomon Codes from Their Definition (Q4577009) (← links)
• Fast Encoding Algorithms for Reed–Solomon Codes With Between Four and Seven Parity Symbols (Q5125926) (← links)