Permutation Polynomials Modulo 2w
Copyright policy )Permutation Polynomials Modulo 2w
The author explicitly characterizes permutation polynomials modulo \(2^n\) for \(n\geq 2\). In addition, he proves that pairs of polynomials defining a pair of orthogonal Latin squares (modulo \(2^n\)) do not exist.
- Massachusetts Institute of Technology United States
Algebra and Number Theory, multipermutation., Applied Mathematics, permutation polynomials, permutation polynomial, Polynomials over finite fields, Theoretical Computer Science, orthogonal Latin squares, Orthogonal arrays, Latin squares, Room squares, latin square, finite field, Polynomials in general fields (irreducibility, etc.), Engineering(all)
Algebra and Number Theory, multipermutation., Applied Mathematics, permutation polynomials, permutation polynomial, Polynomials over finite fields, Theoretical Computer Science, orthogonal Latin squares, Orthogonal arrays, Latin squares, Room squares, latin square, finite field, Polynomials in general fields (irreducibility, etc.), Engineering(all)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).65 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!