New recursive construction of normal polynomials over finite fields

被引：0

作者：

Abrahamyan, Sergey ^{[1
]}

Kyureghyan, Melsik ^{[1
]}

机构：

[1] Inst Informat & Automat Problems, Yerevan 0014, Armenia

来源：

TOPICS IN FINITE FIELDS | 2015年 / 632卷

关键词：

Normal polynomials; composition method; IRREDUCIBLE POLYNOMIALS;

D O I：

10.1090/conm/632/12614

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper addresses the problem of constructing irreducible polynomials with linearly independent roots (or normal polynomials) over a finite field. For a suitably chosen initial normal polynomial g is an element of F-q[x] of degree n, a sequence of normal polynomials F-k is an element of F-q[x] (k = 1, 2, 3, ...) of degree np(k) is constructed by using the polynomial composition method of Varshamov (1984).

引用

页码：1 / 10

页数：10

共 7 条

[1]

Abrahamyan S. Y., 2011, DOKL NATS AKAD NAUK, V111, P232

[2]

[Anonymous], ENCY MATH ITS APPL

[3] TRACE-ORTHOGONAL NORMAL BASES [J].

JUNGNICKEL, D .

DISCRETE APPLIED MATHEMATICS, 1993, 47 (03) :233-249

[4] Iterated constructions of irreducible polynomials over finite fields with linearly independent roots [J].

Kyuregyan, MK .

FINITE FIELDS AND THEIR APPLICATIONS, 2004, 10 (03) :323-341

[5]

Menezes Alfred J., 1993, KLUWER INT SERIES EN, V199

[6]

Mullen G. L., 2013, DISCRETE MATH ITS AP

[7]

VARSHAMOV RR, 1984, DOKL AKAD NAUK SSSR+, V275, P1041

← 1 →