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

DOI10.2298/AADM170530005PzbMath1488.94101MaRDI QIDQ5155704

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

Publication date: 8 October 2021

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

zbMATH Keywords

Newton polygondecodingReed-Solomon codebivariate polynomialsnon-trivial factorization

Mathematics Subject Classification ID

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

Cites Work

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

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