Finding roots of polynomials over finite fields

被引：35
|
作者：
Fedorenko, SV [1 ]
Trifonov, PV [1 ]
机构：
[1] St Petersburg State Polytech Univ, Dept Distributed Computing & Networking, St Petersburg 194021, Russia
来源：
IEEE TRANSACTIONS ON COMMUNICATIONS | 2002年 / 50卷 / 11期
关键词：
affine polynomial; Bose-Chaudhuri-Hocquenghem (BCH) code; Chien search; error-locator polynomial; linearized polynomial; p-polynomial; Reed-Solomon code;
D O I：
10.1109/TCOMM.2002.805269
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
In this letter, we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.
引用
收藏
页码：1709 / 1711
页数：3
相关论文
共 50 条
  • [41] Roots of random polynomials over a finite field
    V. K. Leont’ev
    Mathematical Notes, 2006, 80 : 300 - 304
  • [42] Roots of random polynomials over a finite field
    Leont'ev, V. K.
    MATHEMATICAL NOTES, 2006, 80 (1-2) : 300 - 304
  • [43] DICKSON POLYNOMIALS AND IRREDUCIBLE POLYNOMIALS OVER FINITE-FIELDS
    GAO, SH
    MULLEN, GL
    JOURNAL OF NUMBER THEORY, 1994, 49 (01) : 118 - 132
  • [44] Computing roots of polynomials over function fields of curves
    Gao, SH
    Shokrollahi, MA
    CODING THEORY AND CRYPTOGRAPHY: FROM ENIGMA AND GEHEIMSCHREIBER TO QUANTUM THEORY, 2000, : 214 - 228
  • [45] The coefficients of primitive polynomials over finite fields
    Han, WB
    MATHEMATICS OF COMPUTATION, 1996, 65 (213) : 331 - 340
  • [46] Some permutation polynomials over finite fields
    Marcos, Jose E.
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2015, 26 (05) : 465 - 474
  • [47] Algorithms for factoring polynomials over finite fields
    Lange, T
    Winterhof, A
    FINITE FIELDS AND APPLICATIONS, 2001, : 319 - 328
  • [48] Factoring polynomials over finite fields: A survey
    Von zur Gathen, J
    Panario, D
    JOURNAL OF SYMBOLIC COMPUTATION, 2001, 31 (1-2) : 3 - 17
  • [49] CONSTRUCTING IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS
    Ling, San
    Ozdemir, Enver
    Xing, Chaoping
    MATHEMATICS OF COMPUTATION, 2012, 81 (279) : 1663 - 1668
  • [50] Counting irreducible polynomials over finite fields
    Qichun Wang
    Haibin Kan
    Czechoslovak Mathematical Journal, 2010, 60 : 881 - 886
12345