The following pages link to (Q4495303):
Displaying 13 items.
- List decoding of Hermitian codes using Gröbner bases (Q733508) (← links)
- Power error locating pairs (Q782853) (← links)
- Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes (Q849367) (← links)
- Horner versus Holdred: An episode in the history of root computation (Q1283015) (← links)
- Computation of Minkowski values of polynomials over complex sets (Q1826500) (← links)
- Numerical root finding via Cox rings (Q2173863) (← links)
- An algorithm for decoding skew Reed-Solomon codes with respect to the skew metric (Q2200525) (← links)
- Polynomial root finding over local rings and application to error correcting codes (Q2441447) (← links)
- Parameter choices on Guruswami-Sudan algorithm for polynomial reconstruction (Q2467321) (← links)
- Absolute irreducibility of polynomials via Newton polytopes (Q5936184) (← links)
- On \(\operatorname{Ext}^1\) for Drinfeld modules (Q6184605) (← links)
- Construction-D lattice from Garcia–Stichtenoth tower code (Q6499093) (← links)
- Factoring polynomials over function fields (Q6653359) (← links)
