Improved decoding of Reed-Solomon and algebraic-geometric codes
- 27 November 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Polynomial factorization 1987–1991Published by Springer Science and Business Media LLC ,2005
- Efficient decoding of Reed-Solomon codes beyond half the minimum distancePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Learning polynomials with queries: The highly noisy casePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Decoding algebraic-geometric codes beyond the error-correction boundPublished by Association for Computing Machinery (ACM) ,1998
- Bounded distance+1 soft-decision Reed-Solomon decodingIEEE Transactions on Information Theory, 1996
- Highly resilient correctors for polynomialsInformation Processing Letters, 1992
- Error-correcting codes for list decodingIEEE Transactions on Information Theory, 1991
- Factorization of polynomials over a finite field and the solution of systems of algebraic equationsJournal of Mathematical Sciences, 1986
- A polynomial-time reduction from bivariate to univariate integral polynomial factorizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Encoding and error-correction procedures for the Bose-Chaudhuri codesIEEE Transactions on Information Theory, 1960