Pages that link to "Item:Q3448743"

The following pages link to A New Algorithm for Decoding Reed-Solomon Codes (Q3448743):

Displaying 15 items.

• Simple algorithms for decoding systematic Reed-Solomon codes (Q356717) (← links)
• Fast operations on linearized polynomials and their applications in coding theory (Q1635282) (← links)
• Biorthogonal wavelet codes with prescribed code distance (Q1669574) (← links)
• A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes (Q1675777) (← links)
• Power decoding Reed-Solomon codes up to the Johnson radius (Q1783708) (← links)
• Duality of constacyclic codes of prime power length over the finite non-commutative chain ring \(\frac{ \mathbb{F}_{p^m} [ u , \theta ]}{ \langle u^2 \rangle} \) (Q2124648) (← links)
• Polynomial root finding over local rings and application to error correcting codes (Q2441447) (← links)
• Power Decoding of Reed–Solomon Codes Revisited (Q3460479) (← links)
• Two-dimensional generalized discrete Fourier transform and related quasi-cyclic Reed--Solomon codes (Q4633757) (← links)
• ON DECODING ALGORITHMS FOR GENERALIZED REED — SOLOMON CODES WITH ERRORS AND ERASURES (Q5071451) (← links)
• Decoding algorithms for Goppa codes with errors and erasures (Q5086539) (← links)
• ON DECODING ALGORITHMS FOR GENERALIZED REED — SOLOMON CODES WITH ERRORS AND ERASURES. II (Q5089862) (← links)
• ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS (Q5089874) (← links)
• On decoding algorithms for Goppa codes (Q5153867) (← links)
• Rank-Metric Codes and Their Applications (Q5863764) (← links)