A Note on the Brawley-Carlitz Theorem on Irreducibility of Composed Products of Polynomials over Finite Fields

被引：3

作者：

Munemasa, Akihiro ^{[1
]}

Nakamura, Hiroko ^{[1
]}

机构：

[1] Tohoku Univ, Res Ctr Pure & Appl Math, Grad Sch Informat Sci, Sendai, Miyagi, Japan

来源：

ARITHMETIC OF FINITE FIELDS, WAIFI 2016 | 2016年 / 10064卷

关键词：

Finite field; Composed product; Irreducible polynomial;

D O I：

10.1007/978-3-319-55227-9_7

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We give a new proof of the Brawley-Carlitz theorem on irreducibility of the composed products of irreducible polynomials. Our proof shows that associativity of the binary operation for the composed product is not necessary. We then investigate binary operations defined by polynomial functions, and give a sufficient condition in terms of degrees for the requirement in the Brawley-Carlitz theorem.

引用

页码：84 / 92

页数：9

共 50 条

[1] A note on composed products of polynomials over finite fields
Henning Stichtenoth
Designs, Codes and Cryptography, 2014, 73 : 27 - 32
[2] A note on composed products of polynomials over finite fields
Stichtenoth, Henning
DESIGNS CODES AND CRYPTOGRAPHY, 2014, 73 (01) : 27 - 32
[3] Composed products and factors of cyclotomic polynomials over finite fields
Tuxanidy, Aleksandr
Wang, Qiang
DESIGNS CODES AND CRYPTOGRAPHY, 2013, 69 (02) : 203 - 231
[4] COMPOSED PRODUCTS AND MODULE POLYNOMIALS OVER FINITE-FIELDS
BRAWLEY, JV
BROWN, D
DISCRETE MATHEMATICS, 1993, 117 (1-3) : 41 - 56
[5] Composed products and factors of cyclotomic polynomials over finite fields
Aleksandr Tuxanidy
Qiang Wang
Designs, Codes and Cryptography, 2013, 69 : 203 - 231
[6] On the irreducibility of Fibonacci and Lucas polynomials over finite fields
Kitayama, Hidetaka
Shiomi, Daisuke
FINITE FIELDS AND THEIR APPLICATIONS, 2017, 48 : 420 - 429
[7] Remark on testing irreducibility of polynomials over finite fields
Gashkov, S. B.
Gashkov, I. B.
Advances in Computational Methods in Sciences and Engineering 2005, Vols 4 A & 4 B, 2005, 4A-4B : 204 - 206
[8] DETERMINISTIC IRREDUCIBILITY TESTING OF POLYNOMIALS OVER LARGE FINITE-FIELDS
KALTOFEN, E
JOURNAL OF SYMBOLIC COMPUTATION, 1987, 4 (01) : 77 - 82
[9] A note on permutation polynomials over finite fields
Ma, Jingxue
Ge, Gennian
FINITE FIELDS AND THEIR APPLICATIONS, 2017, 48 : 261 - 270
[10] Analysis of Rabin's irreducibility test for polynomials over finite fields
Panario, D
Pittel, B
Richmond, B
Viola, A
RANDOM STRUCTURES & ALGORITHMS, 2001, 19 (3-4) : 525 - 551

← 1 2 3 4 5 →