Pages that link to "Item:Q4081130"
From MaRDI portal
The following pages link to On the complexity of decoding Reed-Solomon codes (Corresp.) (Q4081130):
Displaying 25 items.
- The decoding of extended Reed-Solomon codes (Q803107) (← links)
- New approaches to reduced-complexity decoding (Q1180151) (← 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)
- 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)
- Algorithms for simultaneous Hermite-Padé approximations (Q2200312) (← links)
- PCPs and the hardness of generating synthetic data (Q2210447) (← links)
- On Reed-Solomon codes (Q2430341) (← links)
- Exploiting the cannibalistic traits of Reed-Solomon codes (Q2726172) (← links)
- Maximum-likelihood decoding of Reed-Solomon codes is NP-hard (Q2921702) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
- Complexity and sliding-block decodability (Q3129478) (← 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)
- (Q4011780) (← links)
- On the complete decoding of constrained codes (Q4034457) (← 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)
- The complexity of error-correcting codes (Q5055921) (← links)
- Negacyclic codes of prime power length over the finite non-commutative chain ring 𝔽pm[u,𝜃] 〈u2〉 (Q5063263) (← links)
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes (Q5281271) (← links)
- Optimal Las Vegas reduction from one-way set reconciliation to error correction (Q5964019) (← links)