Deterministic List Decoding of Reed-Solomon Codes
Open Access
- 9 June 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 2040-2051
Abstract
No abstract availableAll Related Versions
Funding Information
- Department of Atomic Energy, Government of India (RTI4014)
This publication has 15 references indexed in Scilit:
- Factorization of Polynomials Given by Arithmetic Branching Programscomputational complexity, 2021
- Equivalence of Polynomial Identity Testing and Polynomial Factorizationcomputational complexity, 2015
- Modern Computer Algebra2013
- List decoding of algebraic-geometric codesIEEE Transactions on Information Theory, 1999
- Decoding of Reed Solomon Codes beyond the Error-Correction BoundJournal of Complexity, 1997
- On the deterministic complexity of factoring polynomials over finite fieldsInformation Processing Letters, 1990
- Factoring multivariate polynomials over finite fieldsJournal of Computer and System Sciences, 1985
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- Factoring Polynomials Over Finite FieldsBell System Technical Journal, 1967