ON ONE METHOD OF THE THEORY OF REDUCIBILITY OF POLYNOMIALS OVER FINITE-FIELDS

被引：0

|

作者：

VARSHAMOV, RR

机构：

来源：

DOKLADY AKADEMII NAUK SSSR | 1991年 / 319卷 / 04期

关键词：

D O I：

暂无

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

引用

收藏

页码：787 / 791

页数：5

相关论文

共 50 条

[31] A NEW ALGORITHM FOR FACTORING POLYNOMIALS OVER FINITE-FIELDS
CANTOR, DG
ZASSENHAUS, H
[J]. MATHEMATICS OF COMPUTATION, 1981, 36 (154) : 587 - 592
[32] FAST CONSTRUCTION OF IRREDUCIBLE POLYNOMIALS OVER FINITE-FIELDS
SHOUP, V
[J]. JOURNAL OF SYMBOLIC COMPUTATION, 1994, 17 (05) : 371 - 391
[33] POLYNOMIALS OVER FINITE-FIELDS WHICH COMMUTE WITH TRANSLATIONS
WELLS, CF
[J]. NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1974, 21 (02): : A287 - A287
[34] THE DIFFERENCE BETWEEN PERMUTATION POLYNOMIALS OVER FINITE-FIELDS
COHEN, SD
MULLEN, GL
SHIUE, PJS
[J]. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1995, 123 (07) : 2011 - 2015
[35] THE PARALLEL COMPLEXITY OF EXPONENTIATING POLYNOMIALS OVER FINITE-FIELDS
FICH, FE
TOMPA, M
[J]. JOURNAL OF THE ACM, 1988, 35 (03) : 651 - 667
[36] ALGORITHM ABOUT DECOMPOSITION OF POLYNOMIALS OVER FINITE-FIELDS
MIGNOTTE, M
[J]. COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1975, 280 (03): : 137 - 139
[37] FACTORIZATION OF POLYNOMIALS OVER FINITE-FIELDS AND CHARACTERISTIC SEQUENCES
NIEDERREITER, H
GOTTFERT, R
[J]. JOURNAL OF SYMBOLIC COMPUTATION, 1993, 16 (05) : 401 - 412
[38] On the reducibility of some composite polynomials over finite fields
Xiwang Cao
Lei Hu
[J]. Designs, Codes and Cryptography, 2012, 64 : 229 - 239
[39] ANALYSIS OF EUCLIDEAN ALGORITHMS FOR POLYNOMIALS OVER FINITE-FIELDS
MA, K
GATHEN, JV
[J]. JOURNAL OF SYMBOLIC COMPUTATION, 1990, 9 (04) : 429 - 455
[40] VALUE SETS OF DICKSON POLYNOMIALS OVER FINITE-FIELDS
CHOU, WS
GOMEZCALDERON, J
MULLEN, GL
[J]. JOURNAL OF NUMBER THEORY, 1988, 30 (03) : 334 - 344

← 1 2 3 4 5 →