Decoding simultaneous rational evaluation codes
From MaRDI portal
Cites work
- A hierarchy of polynomial time lattice basis reduction algorithms
- Algorithms for Simultaneous Padé Approximations
- Chinese remaindering with errors
- Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs
- Early termination in parametric linear system solving and rational function vector recovery with error correction
- Factoring polynomials with rational coefficients
- scientific article; zbMATH DE number 2038702 (Why is no real title available?)
- Improved algorithms for the shortest vector problem and the closest vector problem in the infinity norm
- Maximal quotient rational reconstruction
- Numerical linear system solving with parametric entries by error correction
- Polynomial Codes Over Certain Finite Fields
- Polynomial linear system solving with random errors. New bounds and early termination technique
- Simultaneous rational function reconstruction with errors: handling multiplicities and poles
- The Exact Solution of Linear Equations with Rational Function Coefficients
Cited in
(2)
This page was built for publication: Decoding simultaneous rational evaluation codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033551)