An application of bivariate polynomial factorization on decoding of Reed-Solomon based codes

DOI10.2298/AADM170530005PMaRDI QIDQ5155704zbMATH OpenFDO

Authors Ivan Pavkov, Nebojša M. Ralević, Ljubo Nedović

Publication date 8 October 2021

Published in Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/AADM170530005P

zbMATH Keywords

bivariate polynomialsdecodingNewton polygonnon-trivial factorizationReed-Solomon code

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05) Linear codes (general theory) (94B05)

Recommendations

• scientific article; zbMATH DE number 800174
• Multi-modular approach to polynomial-time factorization of bivariate integral polynomials
• scientific article; zbMATH DE number 1594297
• On Bivariate Polynomial Factorization over Finite Fields
• Decoding of Reed Solomon codes beyond the error-correction bound

Cites work

• Absolute irreducibility of polynomials via Newton polytopes
• Algorithmic Results in List Decoding
• Decoding of Reed Solomon codes beyond the error-correction bound
• Decomposition of polytopes and polynomials
• Factoring bivariate polynomials with integer coefficients via Newton polygons

Cited in

(3)

• Decoding Reed-Solomon codes beyond (d-1)/2 and zeros of multivariate polynomials
• Decoding of redundant residue polynomial codes using Euclid's algorithm
• Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders

This page was built for publication: An application of bivariate polynomial factorization on decoding of Reed-Solomon based codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5155704)