The Arithmetic of Polynomials in a Galois Field
From MaRDI portal
Publication:4479818
DOI10.2307/2371075zbMath0003.19502OpenAlexW2331404011MaRDI QIDQ4479818
Publication date: 1932
Published in: American Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2371075
reciprocity theoremexplicit formulassummatory functionsGalois fieldarithmetic of polynomialsanalogs of number-theoretic functions
Related Items (15)
Arithmetic functions in short intervals and the symmetric group ⋮ Binary generalized \((L,G)\) codes that are perfect in a weighted Hamming metric ⋮ The number of rational points of hyperelliptic curves over subsets of finite fields ⋮ Higher reciprocity law and an analogue of the Grunwald-Wang theorem for the ring of polynomials over an ultra-finite field ⋮ An elementary proof of the law of quadratic reciprocity over function fields ⋮ Distribution of polynomial discriminants modulo a prime ⋮ Gauss' lemma over function fields ⋮ Lower bound of covering radius of binary irreducible Goppa codes ⋮ The exact length of the Euclidean algorithm in [ X ] ⋮ The values of a polynomial over a finite field ⋮ Some arithmetical functions in finite fields ⋮ Correlation of arithmetic functions over \(\mathbb{F}_q[T\)] ⋮ On the density of irreducible polynomials which generate \(k\)-free polynomials over function fields ⋮ Low-discrepancy point sets obtained by digital constructions over finite fields ⋮ Hensel lifting and bivariate polynomial factorisation over finite fields
This page was built for publication: The Arithmetic of Polynomials in a Galois Field