Pages that link to "Item:Q803107"
From MaRDI portal
The following pages link to The decoding of extended Reed-Solomon codes (Q803107):
Displaying 18 items.
- Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6 (Q1180155) (← links)
- On the covering radius of Reed-Solomon codes (Q1318799) (← links)
- Parallel decoding of the Reed-Solomon codes (Q1778370) (← links)
- Power decoding Reed-Solomon codes up to the Johnson radius (Q1783708) (← links)
- Decoding Reed-Solomon codes beyond \((d-1)/2\) and zeros of multivariate polynomials (Q1897984) (← links)
- Some results on deep holes of generalized projective Reed-Solomon codes (Q2335326) (← links)
- Exploiting the cannibalistic traits of Reed-Solomon codes (Q2726172) (← links)
- Maximum-likelihood decoding of Reed-Solomon codes is NP-hard (Q2921702) (← 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)
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard (Q3546964) (← links)
- Decoding Folded Reed–Solomon Codes Using Hensel-Lifting (Q3652834) (← links)
- Decoding of redundant residue polynomial codes using Euclid's algorithm (Q3818989) (← links)
- On the complexity of decoding Reed-Solomon codes (Corresp.) (Q4081130) (← links)
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance (Q4503508) (← links)
- A Decoding Approach to Reed–Solomon Codes from Their Definition (Q4577009) (← links)
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes (Q5281271) (← links)