Permutations of finite fields for check digit systems (Q1960224): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-010-9374-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2141445884 / rank
 
Normal rank

Revision as of 02:13, 20 March 2024

scientific article
Language Label Description Also known as
English
Permutations of finite fields for check digit systems
scientific article

    Statements

    Permutations of finite fields for check digit systems (English)
    0 references
    0 references
    0 references
    13 October 2010
    0 references
    From the authors' abstract: Let \(q\) be a prime power and \(n\) a positive divisor of \(q-1\). We prove an asymptotic formula for the number of polynomials \[ f(X)=\frac{a-b}{n}\bigg(\sum_{j=1}^{n-1} X^{j(q-1)/n}\bigg)X+\frac{a+b(n-1)}{n}\,X\in\mathbb{F}_q[X] \] such that the polynomials \(f(X)\), \(f(X)\pm X\), and \(f(f(X))\pm X\) are all permutation polynomials over \(\mathbb{F}_q\).
    0 references
    check digit systems
    0 references
    finite fields
    0 references
    permutation polynomials
    0 references
    orthomorphisms
    0 references
    complete mappings
    0 references
    cyclotomy
    0 references

    Identifiers