Pages that link to "Item:Q4577009"
From MaRDI portal
The following pages link to A Decoding Approach to Reed–Solomon Codes from Their Definition (Q4577009):
Displaying 13 items.
- Simple algorithms for decoding systematic Reed-Solomon codes (Q356717) (← links)
- The decoding of extended Reed-Solomon codes (Q803107) (← links)
- Two new decoding algorithms for Reed-Solomon codes (Q1311609) (← links)
- Decoding Reed-Solomon codes beyond \((d-1)/2\) and zeros of multivariate polynomials (Q1897984) (← links)
- A Reed–Solomon Code Magic Trick (Q2929453) (← links)
- A Universal Reed-Solomon Decoder (Q3325629) (← 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)
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard (Q3546964) (← links)
- Decoding Folded Reed–Solomon Codes Using Hensel-Lifting (Q3652834) (← links)
- On the complexity of decoding Reed-Solomon codes (Corresp.) (Q4081130) (← links)
- An encoder to match Reed-Solomon codes over GF(q) to a subalphabet of GF(q) (Q4701436) (← links)