A characterization and an explicit description of all primitive polynomials of degree two
IF 1.2
3区 数学
Q1 MATHEMATICS
引用次数: 0
Abstract
For polynomials of degree two over finite fields, we present an improvement of Fitzgerald's characterization of primitive polynomials. We then use this new characterization to obtain an explicit, complete, and simple description of all primitive polynomials of degree two over finite fields.
二阶多项式的一个特征和一个明确的描述
对于有限域上的二阶多项式，我们给出了对Fitzgerald关于原始多项式的描述的改进。然后，我们利用这个新的表征得到了有限域上所有二阶多项式的显式、完整和简单的描述。
本文章由计算机程序翻译，如有差异，请以英文原文为准。
求助全文
约1分钟内获得全文
求助全文
来源期刊
CiteScore
2.00
自引率
20.00%
发文量
133
审稿时长
6-12 weeks
期刊介绍：
Finite Fields and Their Applications is a peer-reviewed technical journal publishing papers in finite field theory as well as in applications of finite fields. As a result of applications in a wide variety of areas, finite fields are increasingly important in several areas of mathematics, including linear and abstract algebra, number theory and algebraic geometry, as well as in computer science, statistics, information theory, and engineering.
For cohesion, and because so many applications rely on various theoretical properties of finite fields, it is essential that there be a core of high-quality papers on theoretical aspects. In addition, since much of the vitality of the area comes from computational problems, the journal publishes papers on computational aspects of finite fields as well as on algorithms and complexity of finite field-related methods.
The journal also publishes papers in various applications including, but not limited to, algebraic coding theory, cryptology, combinatorial design theory, pseudorandom number generation, and linear recurring sequences. There are other areas of application to be included, but the important point is that finite fields play a nontrivial role in the theory, application, or algorithm.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
