Nets and sequences obtained from irreducible polynomials over finite fields

被引：1
|
作者：
Knopfmacher, A [1 ]
Ridley, JN
Mullen, GL
机构：
[1] Univ Witwatersrand, Johannesburg, South Africa
[2] Penn State Univ, Dept Math, University Pk, PA 16802 USA
来源：
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING | 1998年 / 9卷 / 03期
关键词：
finite field; irreducible Polynomial; (t; m; s)-net in base b;
D O I：
10.1007/s002000050107
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We prove an elementary result concerning the sum of the degrees of irreducible polynomials over a finite field. This result has application in the construction of (t, m, s)-nets which are useful in numerical integration.
引用
收藏
页码：265 / 269
页数：5
相关论文
共 50 条
  • [31] GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS
    Ahn, Youngwoo
    Kim, Kitae
    KOREAN JOURNAL OF MATHEMATICS, 2011, 19 (03): : 263 - 272
  • [32] Self-reciprocal irreducible polynomials over finite fields
    Yucas, JL
    Mullen, GL
    DESIGNS CODES AND CRYPTOGRAPHY, 2004, 33 (03) : 275 - 281
  • [33] Irreducible polynomials over finite fields produced by composition of quadratics
    Heath-Brown, David Rodney
    Micheli, Giacomo
    REVISTA MATEMATICA IBEROAMERICANA, 2019, 35 (03) : 847 - 855
  • [34] Number of irreducible polynomials in several variables over finite fields
    Bodin, Arnaud
    AMERICAN MATHEMATICAL MONTHLY, 2008, 115 (07): : 653 - 660
  • [35] Self-Reciprocal Irreducible Polynomials Over Finite Fields
    Joseph L. Yucas
    Gary L. Mullen
    Designs, Codes and Cryptography, 2004, 33 : 275 - 281
  • [36] Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields
    Kopparty, Swastik
    Kumar, Mrinal
    Saks, Michael
    THEORY OF COMPUTING, 2016, 12
  • [37] A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields
    Abrahamyan, Sergey
    Kyureghyan, Melsik
    COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, 2011, 6885 : 1 - 9
  • [38] NETS OBTAINED FROM RATIONAL FUNCTIONS OVER FINITE-FIELDS
    LARCHER, G
    ACTA ARITHMETICA, 1993, 63 (01) : 1 - 13
  • [39] Constructions of irreducible polynomials over finite fields with even characteristic
    Sharma, P. L.
    Ashima
    Gupta, Shalini
    Harish, Mansi
    Kumar, Sushil
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2023, 54 (03): : 734 - 742
  • [40] Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields
    Kopparty, Swastik
    Kumar, Mrinal
    Saks, Michael
    AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I, 2014, 8572 : 726 - 737
12345