Pages that link to "Item:Q1897984"
From MaRDI portal
The following pages link to Decoding Reed-Solomon codes beyond \((d-1)/2\) and zeros of multivariate polynomials (Q1897984):
Displaying 4 items.
- Decoding of Reed Solomon codes beyond the error-correction bound (Q1361883) (← links)
- Decoding of redundant residue polynomial codes using Euclid's algorithm (Q3818989) (← links)
- Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders (Q4552984) (← links)
- Repairing Reed-Solomon Codes via Subspace Polynomials (Q5032504) (← links)