Algorithmizing the multiplicity Schwartz-Zippel lemma
From MaRDI portal
Cites work
- A probabilistic remark on algebraic program testing
- Algebraic coding theory
- Algorithmizing the Multiplicity Schwartz-Zippel Lemma
- Computational Complexity
- Decoding multivariate multiplicity codes on product sets
- Decoding of Reed Solomon codes beyond the error-correction bound
- Decoding Reed-Muller codes over product sets
- Encoding and error-correction procedures for the Bose-Chaudhuri codes
- Extensions to the method of multiplicities, with applications to Kakeya sets and mergers
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Generalized minimum distance decoding
- High-rate codes with sublinear-time decoding
- Highly resilient correctors for polynomials
- scientific article; zbMATH DE number 6603592 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- List-decoding multiplicity codes
- Matching theory
- Shift-register synthesis and BCH decoding
- Über höhere Kongruenzen.
This page was built for publication: Algorithmizing the multiplicity Schwartz-Zippel lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858213)