Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/1684
Title: | An application of bivariate polynomial factorization on decoding of Reed-Solomon based codes | Authors: | Pavkov, Ivan Ralević, Nebojša Nedović, Ljubo |
Issue Date: | 1-Apr-2018 | Journal: | Applicable Analysis and Discrete Mathematics | Abstract: | © 2014 - Applicable Analysis and Discrete Mathematics. A necessary and sufficient condition for the existence of a non-trivial factorization of an arbitrary bivariate polynomial with integer coefficients was presented in [2]. In this paper we develop an efficient algorithm for factoring bivariate polynomials with integer coefficients. Also, we shall give a proof of the optimality of the algorithm. For a given codeword, formed by mixing up two codewords, the algorithm recovers those codewords directly by factoring corresponding bivariate polynomial. Our algorithm determines uniquely the given polynomials which are used in forming the mixture of two codewords. | URI: | https://open.uns.ac.rs/handle/123456789/1684 | ISSN: | 14528630 | DOI: | 10.2298/AADM170530005P |
Appears in Collections: | POLJF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
1
checked on May 3, 2024
Page view(s)
37
Last Week
9
9
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.