Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/1684
Nаziv: | An application of bivariate polynomial factorization on decoding of Reed-Solomon based codes | Аutоri: | Pavkov, Ivan Ralević, Nebojša Nedović, Ljubo |
Dаtum izdаvаnjа: | 1-апр-2018 | Čаsоpis: | Applicable Analysis and Discrete Mathematics | Sažetak: | © 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 |
Nаlаzi sе u kоlеkciјаmа: | POLJF Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
1
prоvеrеnо 03.05.2024.
Prеglеd/i stаnicа
37
Prоtеklа nеdеljа
9
9
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.